/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label07.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 09:23:21,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 09:23:21,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 09:23:21,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 09:23:21,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 09:23:21,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 09:23:21,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 09:23:21,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 09:23:21,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 09:23:21,519 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 09:23:21,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 09:23:21,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 09:23:21,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 09:23:21,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 09:23:21,522 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 09:23:21,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 09:23:21,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 09:23:21,523 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 09:23:21,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 09:23:21,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 09:23:21,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 09:23:21,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 09:23:21,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 09:23:21,525 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 09:23:21,525 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 09:23:21,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 09:23:21,525 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 09:23:21,526 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 09:23:21,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 09:23:21,526 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 09:23:21,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 09:23:21,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 09:23:21,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 09:23:21,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 09:23:21,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:23:21,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 09:23:21,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 09:23:21,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 09:23:21,529 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 09:23:21,529 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 09:23:21,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 09:23:21,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 09:23:21,529 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 09:23:21,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 09:23:21,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 09:23:21,530 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 09:23:21,530 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 09:23:21,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 09:23:21,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 09:23:21,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 09:23:21,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 09:23:21,814 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 09:23:21,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label07.c [2023-12-16 09:23:23,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 09:23:23,268 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 09:23:23,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label07.c [2023-12-16 09:23:23,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0129511e2/dfd9c0eb935547e8b6c4cdff9d75d96c/FLAGf07055b57 [2023-12-16 09:23:23,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0129511e2/dfd9c0eb935547e8b6c4cdff9d75d96c [2023-12-16 09:23:23,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 09:23:23,318 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 09:23:23,319 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 09:23:23,319 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 09:23:23,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 09:23:23,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:23,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4febe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23, skipping insertion in model container [2023-12-16 09:23:23,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:23,380 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 09:23:23,558 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label07.c[4912,4925] [2023-12-16 09:23:23,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:23:23,738 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 09:23:23,760 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label07.c[4912,4925] [2023-12-16 09:23:23,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:23:23,892 INFO L206 MainTranslator]: Completed translation [2023-12-16 09:23:23,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23 WrapperNode [2023-12-16 09:23:23,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 09:23:23,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 09:23:23,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 09:23:23,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 09:23:23,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:23,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:23,980 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 857 [2023-12-16 09:23:23,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 09:23:23,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 09:23:23,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 09:23:23,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 09:23:24,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,058 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 09:23:24,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,093 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 09:23:24,110 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 09:23:24,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 09:23:24,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 09:23:24,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (1/1) ... [2023-12-16 09:23:24,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:23:24,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 09:23:24,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 09:23:24,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 09:23:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 09:23:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 09:23:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 09:23:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 09:23:24,271 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 09:23:24,273 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 09:23:27,513 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 09:23:27,602 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 09:23:27,603 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 09:23:27,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:23:27 BoogieIcfgContainer [2023-12-16 09:23:27,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 09:23:27,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 09:23:27,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 09:23:27,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 09:23:27,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:23:23" (1/3) ... [2023-12-16 09:23:27,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e48c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:23:27, skipping insertion in model container [2023-12-16 09:23:27,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:23:23" (2/3) ... [2023-12-16 09:23:27,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e48c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:23:27, skipping insertion in model container [2023-12-16 09:23:27,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:23:27" (3/3) ... [2023-12-16 09:23:27,612 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label07.c [2023-12-16 09:23:27,627 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 09:23:27,628 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 09:23:27,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 09:23:27,685 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@78fd3e15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 09:23:27,685 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 09:23:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 09:23:27,698 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:23:27,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:23:27,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:23:27,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:23:27,704 INFO L85 PathProgramCache]: Analyzing trace with hash 52230512, now seen corresponding path program 1 times [2023-12-16 09:23:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:23:27,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355410581] [2023-12-16 09:23:27,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:23:27,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:27,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:23:27,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:23:27,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 09:23:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:23:27,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 09:23:27,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:23:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:23:27,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:23:27,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:23:27,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355410581] [2023-12-16 09:23:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355410581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:23:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:23:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:23:27,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311353644] [2023-12-16 09:23:27,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:23:27,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 09:23:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:23:27,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 09:23:27,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:23:27,870 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:23:27,911 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2023-12-16 09:23:27,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 09:23:27,916 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-16 09:23:27,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:23:27,929 INFO L225 Difference]: With dead ends: 365 [2023-12-16 09:23:27,930 INFO L226 Difference]: Without dead ends: 181 [2023-12-16 09:23:27,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:23:27,935 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:23:27,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 09:23:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-16 09:23:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-12-16 09:23:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2023-12-16 09:23:27,990 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 46 [2023-12-16 09:23:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:23:27,991 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2023-12-16 09:23:27,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2023-12-16 09:23:27,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-16 09:23:27,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:23:27,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:23:27,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 09:23:28,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:28,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:23:28,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:23:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 996336860, now seen corresponding path program 1 times [2023-12-16 09:23:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:23:28,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899192875] [2023-12-16 09:23:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:23:28,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:23:28,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:23:28,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 09:23:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:23:28,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:23:28,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:23:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:23:28,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:23:28,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:23:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899192875] [2023-12-16 09:23:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899192875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:23:28,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:23:28,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:23:28,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966172826] [2023-12-16 09:23:28,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:23:28,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:23:28,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:23:28,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:23:28,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:23:28,366 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:23:31,645 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2023-12-16 09:23:31,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:23:31,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-16 09:23:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:23:31,651 INFO L225 Difference]: With dead ends: 539 [2023-12-16 09:23:31,651 INFO L226 Difference]: Without dead ends: 359 [2023-12-16 09:23:31,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:23:31,654 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 152 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-16 09:23:31,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 87 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-16 09:23:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-16 09:23:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2023-12-16 09:23:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2023-12-16 09:23:31,675 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 46 [2023-12-16 09:23:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:23:31,676 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2023-12-16 09:23:31,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:31,676 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2023-12-16 09:23:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 09:23:31,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:23:31,679 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:23:31,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 09:23:31,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:31,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:23:31,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:23:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1537004027, now seen corresponding path program 1 times [2023-12-16 09:23:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:23:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946511916] [2023-12-16 09:23:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:23:31,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:31,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:23:31,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:23:31,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 09:23:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:23:31,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:23:31,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:23:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:23:32,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:23:32,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:23:32,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946511916] [2023-12-16 09:23:32,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946511916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:23:32,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:23:32,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:23:32,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705907708] [2023-12-16 09:23:32,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:23:32,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:23:32,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:23:32,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:23:32,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:23:32,464 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:23:35,040 INFO L93 Difference]: Finished difference Result 895 states and 1231 transitions. [2023-12-16 09:23:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:23:35,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-16 09:23:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:23:35,043 INFO L225 Difference]: With dead ends: 895 [2023-12-16 09:23:35,043 INFO L226 Difference]: Without dead ends: 537 [2023-12-16 09:23:35,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:23:35,045 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 112 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 09:23:35,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 112 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 09:23:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2023-12-16 09:23:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2023-12-16 09:23:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.3041044776119404) internal successors, (699), 536 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 699 transitions. [2023-12-16 09:23:35,065 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 699 transitions. Word has length 115 [2023-12-16 09:23:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:23:35,065 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 699 transitions. [2023-12-16 09:23:35,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 699 transitions. [2023-12-16 09:23:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-16 09:23:35,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:23:35,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:23:35,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 09:23:35,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:35,276 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:23:35,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:23:35,276 INFO L85 PathProgramCache]: Analyzing trace with hash -300212843, now seen corresponding path program 1 times [2023-12-16 09:23:35,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:23:35,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695491909] [2023-12-16 09:23:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:23:35,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:35,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:23:35,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:23:35,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 09:23:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:23:35,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:23:35,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:23:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:23:35,599 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:23:35,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:23:35,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695491909] [2023-12-16 09:23:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695491909] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:23:35,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:23:35,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:23:35,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271712099] [2023-12-16 09:23:35,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:23:35,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:23:35,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:23:35,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:23:35,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:23:35,602 INFO L87 Difference]: Start difference. First operand 537 states and 699 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:23:39,158 INFO L93 Difference]: Finished difference Result 1251 states and 1690 transitions. [2023-12-16 09:23:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:23:39,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2023-12-16 09:23:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:23:39,166 INFO L225 Difference]: With dead ends: 1251 [2023-12-16 09:23:39,166 INFO L226 Difference]: Without dead ends: 893 [2023-12-16 09:23:39,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:23:39,168 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-16 09:23:39,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 118 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-16 09:23:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2023-12-16 09:23:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2023-12-16 09:23:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.243273542600897) internal successors, (1109), 892 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1109 transitions. [2023-12-16 09:23:39,190 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1109 transitions. Word has length 151 [2023-12-16 09:23:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:23:39,191 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 1109 transitions. [2023-12-16 09:23:39,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1109 transitions. [2023-12-16 09:23:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-16 09:23:39,194 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:23:39,195 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:23:39,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 09:23:39,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:39,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:23:39,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:23:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1912834312, now seen corresponding path program 1 times [2023-12-16 09:23:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:23:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861125660] [2023-12-16 09:23:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:23:39,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:39,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:23:39,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:23:39,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 09:23:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:23:39,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 09:23:39,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:23:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 09:23:40,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:23:40,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:23:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861125660] [2023-12-16 09:23:40,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861125660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:23:40,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:23:40,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 09:23:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918976306] [2023-12-16 09:23:40,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:23:40,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 09:23:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:23:40,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 09:23:40,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 09:23:40,214 INFO L87 Difference]: Start difference. First operand 893 states and 1109 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:23:42,795 INFO L93 Difference]: Finished difference Result 1280 states and 1658 transitions. [2023-12-16 09:23:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 09:23:42,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2023-12-16 09:23:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:23:42,798 INFO L225 Difference]: With dead ends: 1280 [2023-12-16 09:23:42,798 INFO L226 Difference]: Without dead ends: 715 [2023-12-16 09:23:42,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 09:23:42,800 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 101 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 09:23:42,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 117 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 09:23:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-12-16 09:23:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2023-12-16 09:23:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2324929971988796) internal successors, (880), 714 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 880 transitions. [2023-12-16 09:23:42,815 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 880 transitions. Word has length 195 [2023-12-16 09:23:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:23:42,816 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 880 transitions. [2023-12-16 09:23:42,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 880 transitions. [2023-12-16 09:23:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2023-12-16 09:23:42,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:23:42,828 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:23:42,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 09:23:43,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:43,035 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:23:43,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:23:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1462324111, now seen corresponding path program 1 times [2023-12-16 09:23:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:23:43,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220871368] [2023-12-16 09:23:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:23:43,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:43,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:23:43,038 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:23:43,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 09:23:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:23:43,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:23:43,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:23:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 134 proven. 131 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:23:43,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:23:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:23:44,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:23:44,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220871368] [2023-12-16 09:23:44,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220871368] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:23:44,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:23:44,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:23:44,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977068831] [2023-12-16 09:23:44,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:23:44,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:23:44,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:23:44,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:23:44,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:23:44,169 INFO L87 Difference]: Start difference. First operand 715 states and 880 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:23:49,501 INFO L93 Difference]: Finished difference Result 1429 states and 1919 transitions. [2023-12-16 09:23:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:23:49,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2023-12-16 09:23:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:23:49,507 INFO L225 Difference]: With dead ends: 1429 [2023-12-16 09:23:49,507 INFO L226 Difference]: Without dead ends: 1071 [2023-12-16 09:23:49,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:23:49,510 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-12-16 09:23:49,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 264 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-12-16 09:23:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-16 09:23:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-16 09:23:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.2794392523364486) internal successors, (1369), 1070 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1369 transitions. [2023-12-16 09:23:49,531 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1369 transitions. Word has length 323 [2023-12-16 09:23:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:23:49,533 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1369 transitions. [2023-12-16 09:23:49,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1369 transitions. [2023-12-16 09:23:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2023-12-16 09:23:49,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:23:49,536 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:23:49,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 09:23:49,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:49,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:23:49,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:23:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash 337090486, now seen corresponding path program 1 times [2023-12-16 09:23:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:23:49,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022473487] [2023-12-16 09:23:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:23:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:23:49,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:23:49,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 09:23:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:23:49,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:23:49,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:23:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 134 proven. 135 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:23:50,310 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:23:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:23:50,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:23:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022473487] [2023-12-16 09:23:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022473487] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:23:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:23:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:23:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531963926] [2023-12-16 09:23:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:23:50,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:23:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:23:50,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:23:50,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:23:50,977 INFO L87 Difference]: Start difference. First operand 1071 states and 1369 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:23:57,032 INFO L93 Difference]: Finished difference Result 2319 states and 3160 transitions. [2023-12-16 09:23:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:23:57,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2023-12-16 09:23:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:23:57,037 INFO L225 Difference]: With dead ends: 2319 [2023-12-16 09:23:57,038 INFO L226 Difference]: Without dead ends: 1605 [2023-12-16 09:23:57,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 645 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:23:57,040 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 134 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:23:57,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 55 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-12-16 09:23:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2023-12-16 09:23:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2023-12-16 09:23:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.2662094763092269) internal successors, (2031), 1604 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2031 transitions. [2023-12-16 09:23:57,069 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2031 transitions. Word has length 325 [2023-12-16 09:23:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:23:57,070 INFO L495 AbstractCegarLoop]: Abstraction has 1605 states and 2031 transitions. [2023-12-16 09:23:57,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:23:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2031 transitions. [2023-12-16 09:23:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2023-12-16 09:23:57,095 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:23:57,095 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:23:57,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 09:23:57,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:57,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:23:57,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:23:57,302 INFO L85 PathProgramCache]: Analyzing trace with hash 878623109, now seen corresponding path program 1 times [2023-12-16 09:23:57,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:23:57,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770746275] [2023-12-16 09:23:57,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:23:57,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:23:57,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:23:57,304 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:23:57,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 09:23:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:23:57,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:23:57,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:23:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-12-16 09:23:57,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:23:57,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:23:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770746275] [2023-12-16 09:23:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770746275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:23:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:23:57,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:23:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885752396] [2023-12-16 09:23:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:23:57,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:23:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:23:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:23:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:23:57,875 INFO L87 Difference]: Start difference. First operand 1605 states and 2031 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:24:01,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:24:01,437 INFO L93 Difference]: Finished difference Result 3387 states and 4449 transitions. [2023-12-16 09:24:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:24:01,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2023-12-16 09:24:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:24:01,444 INFO L225 Difference]: With dead ends: 3387 [2023-12-16 09:24:01,444 INFO L226 Difference]: Without dead ends: 2139 [2023-12-16 09:24:01,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:24:01,447 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 74 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-16 09:24:01,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 115 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-16 09:24:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2023-12-16 09:24:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2023-12-16 09:24:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.2474275023386343) internal successors, (2667), 2138 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:24:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2667 transitions. [2023-12-16 09:24:01,484 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2667 transitions. Word has length 331 [2023-12-16 09:24:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:24:01,484 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 2667 transitions. [2023-12-16 09:24:01,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:24:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2667 transitions. [2023-12-16 09:24:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2023-12-16 09:24:01,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:24:01,487 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:24:01,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 09:24:01,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:24:01,699 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:24:01,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:24:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2145204604, now seen corresponding path program 1 times [2023-12-16 09:24:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:24:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777035747] [2023-12-16 09:24:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:24:01,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:24:01,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:24:01,702 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:24:01,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 09:24:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:24:01,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 09:24:01,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:24:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:24:03,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:24:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 248 proven. 77 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:24:10,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:24:10,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777035747] [2023-12-16 09:24:10,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777035747] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 09:24:10,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 09:24:10,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-16 09:24:10,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572140001] [2023-12-16 09:24:10,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 09:24:10,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 09:24:10,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:24:10,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 09:24:10,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-16 09:24:10,593 INFO L87 Difference]: Start difference. First operand 2139 states and 2667 transitions. Second operand has 9 states, 9 states have (on average 53.666666666666664) internal successors, (483), 8 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 09:24:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 09:24:29,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-16 09:24:29,382 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 2117 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2117 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2023-12-16 09:24:29,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2117 Valid, 48 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 17.9s Time] [2023-12-16 09:24:29,383 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 09:24:29,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 09:24:29,392 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 09:24:29,424 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 09:24:29,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:24:29,584 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2139states) and FLOYD_HOARE automaton (currently 12 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (3644 states constructed, input type IntersectNwa). [2023-12-16 09:24:29,588 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:24:29,591 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 09:24:29,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:24:29 BoogieIcfgContainer [2023-12-16 09:24:29,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 09:24:29,593 INFO L158 Benchmark]: Toolchain (without parser) took 66275.85ms. Allocated memory was 195.0MB in the beginning and 288.4MB in the end (delta: 93.3MB). Free memory was 149.7MB in the beginning and 170.5MB in the end (delta: -20.8MB). Peak memory consumption was 73.2MB. Max. memory is 8.0GB. [2023-12-16 09:24:29,594 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 09:24:29,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.19ms. Allocated memory is still 195.0MB. Free memory was 149.7MB in the beginning and 111.8MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-16 09:24:29,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.99ms. Allocated memory is still 195.0MB. Free memory was 111.8MB in the beginning and 105.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 09:24:29,594 INFO L158 Benchmark]: Boogie Preprocessor took 128.10ms. Allocated memory is still 195.0MB. Free memory was 105.2MB in the beginning and 98.3MB in the end (delta: 6.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 09:24:29,595 INFO L158 Benchmark]: RCFGBuilder took 3493.06ms. Allocated memory was 195.0MB in the beginning and 288.4MB in the end (delta: 93.3MB). Free memory was 98.3MB in the beginning and 252.6MB in the end (delta: -154.3MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. [2023-12-16 09:24:29,595 INFO L158 Benchmark]: TraceAbstraction took 61987.38ms. Allocated memory is still 288.4MB. Free memory was 251.5MB in the beginning and 170.5MB in the end (delta: 81.0MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. [2023-12-16 09:24:29,596 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 195.0MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 574.19ms. Allocated memory is still 195.0MB. Free memory was 149.7MB in the beginning and 111.8MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.99ms. Allocated memory is still 195.0MB. Free memory was 111.8MB in the beginning and 105.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 128.10ms. Allocated memory is still 195.0MB. Free memory was 105.2MB in the beginning and 98.3MB in the end (delta: 6.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 3493.06ms. Allocated memory was 195.0MB in the beginning and 288.4MB in the end (delta: 93.3MB). Free memory was 98.3MB in the beginning and 252.6MB in the end (delta: -154.3MB). Peak memory consumption was 49.1MB. Max. memory is 8.0GB. * TraceAbstraction took 61987.38ms. Allocated memory is still 288.4MB. Free memory was 251.5MB in the beginning and 170.5MB in the end (delta: 81.0MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 155]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 155). Cancelled while NwaCegarLoop was constructing difference of abstraction (2139states) and FLOYD_HOARE automaton (currently 12 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (3644 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.9s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 45.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2887 SdHoareTripleChecker+Valid, 44.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2887 mSDsluCounter, 1211 SdHoareTripleChecker+Invalid, 38.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 792 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6181 IncrementalHoareTripleChecker+Invalid, 6973 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 792 mSolverCounterUnsat, 1145 mSDtfsCounter, 6181 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2881 GetRequests, 2855 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2139occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 1885 NumberOfCodeBlocks, 1885 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2874 ConstructedInterpolants, 0 QuantifiedInterpolants, 12262 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2279 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 2304/2972 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown