/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/Problem01_label34.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 08:22:31,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 08:22:31,272 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 08:22:31,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 08:22:31,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 08:22:31,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 08:22:31,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 08:22:31,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 08:22:31,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 08:22:31,309 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 08:22:31,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 08:22:31,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 08:22:31,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 08:22:31,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 08:22:31,310 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 08:22:31,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 08:22:31,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 08:22:31,311 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 08:22:31,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 08:22:31,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 08:22:31,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 08:22:31,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 08:22:31,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 08:22:31,312 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 08:22:31,313 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 08:22:31,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 08:22:31,313 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 08:22:31,313 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 08:22:31,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 08:22:31,313 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 08:22:31,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 08:22:31,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 08:22:31,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 08:22:31,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 08:22:31,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:22:31,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 08:22:31,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 08:22:31,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 08:22:31,315 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 08:22:31,315 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 08:22:31,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 08:22:31,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 08:22:31,316 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 08:22:31,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 08:22:31,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 08:22:31,316 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 08:22:31,316 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 08:22:31,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 08:22:31,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 08:22:31,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 08:22:31,518 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 08:22:31,518 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 08:22:31,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label34.c [2023-12-16 08:22:32,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 08:22:32,836 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 08:22:32,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label34.c [2023-12-16 08:22:32,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95bace7c9/0c0366e6549f476bb6805fd9c860b9bb/FLAG5a51cd3a0 [2023-12-16 08:22:32,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95bace7c9/0c0366e6549f476bb6805fd9c860b9bb [2023-12-16 08:22:32,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 08:22:32,871 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 08:22:32,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 08:22:32,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 08:22:32,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 08:22:32,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:22:32" (1/1) ... [2023-12-16 08:22:32,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a8eabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:32, skipping insertion in model container [2023-12-16 08:22:32,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:22:32" (1/1) ... [2023-12-16 08:22:32,934 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 08:22:33,270 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/Problem01_label34.c[18605,18618] [2023-12-16 08:22:33,291 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:22:33,316 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 08:22:33,380 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/Problem01_label34.c[18605,18618] [2023-12-16 08:22:33,388 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 08:22:33,398 INFO L206 MainTranslator]: Completed translation [2023-12-16 08:22:33,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33 WrapperNode [2023-12-16 08:22:33,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 08:22:33,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 08:22:33,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 08:22:33,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 08:22:33,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,471 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 656 [2023-12-16 08:22:33,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 08:22:33,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 08:22:33,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 08:22:33,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 08:22:33,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,530 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 08:22:33,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 08:22:33,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 08:22:33,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 08:22:33,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 08:22:33,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (1/1) ... [2023-12-16 08:22:33,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 08:22:33,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 08:22:33,625 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 08:22:33,627 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 08:22:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 08:22:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 08:22:33,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 08:22:33,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 08:22:33,742 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 08:22:33,743 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 08:22:34,604 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 08:22:34,652 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 08:22:34,652 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 08:22:34,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:22:34 BoogieIcfgContainer [2023-12-16 08:22:34,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 08:22:34,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 08:22:34,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 08:22:34,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 08:22:34,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:22:32" (1/3) ... [2023-12-16 08:22:34,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b08ec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:22:34, skipping insertion in model container [2023-12-16 08:22:34,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:22:33" (2/3) ... [2023-12-16 08:22:34,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b08ec58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:22:34, skipping insertion in model container [2023-12-16 08:22:34,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:22:34" (3/3) ... [2023-12-16 08:22:34,659 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label34.c [2023-12-16 08:22:34,671 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 08:22:34,671 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 08:22:34,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 08:22:34,721 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;@2d31e479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 08:22:34,721 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 08:22:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 08:22:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 08:22:34,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:34,742 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, 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 08:22:34,742 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:34,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:34,748 INFO L85 PathProgramCache]: Analyzing trace with hash 202567506, now seen corresponding path program 1 times [2023-12-16 08:22:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:34,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813294407] [2023-12-16 08:22:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:34,760 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 08:22:34,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:34,792 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 08:22:34,860 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 08:22:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:34,976 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 08:22:34,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:35,000 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 08:22:35,000 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:35,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813294407] [2023-12-16 08:22:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813294407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 08:22:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294131804] [2023-12-16 08:22:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:35,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 08:22:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:35,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 08:22:35,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 08:22:35,031 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 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 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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 08:22:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:35,069 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2023-12-16 08:22:35,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 08:22:35,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2023-12-16 08:22:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:35,084 INFO L225 Difference]: With dead ends: 271 [2023-12-16 08:22:35,084 INFO L226 Difference]: Without dead ends: 134 [2023-12-16 08:22:35,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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 08:22:35,090 INFO L413 NwaCegarLoop]: 200 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, 200 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 08:22:35,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 08:22:35,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-16 08:22:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-12-16 08:22:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 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 08:22:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2023-12-16 08:22:35,118 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 104 [2023-12-16 08:22:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:35,118 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2023-12-16 08:22:35,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.0) internal successors, (104), 2 states have internal predecessors, (104), 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 08:22:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2023-12-16 08:22:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 08:22:35,119 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:35,120 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, 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 08:22:35,125 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 08:22:35,322 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 08:22:35,323 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:35,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:35,323 INFO L85 PathProgramCache]: Analyzing trace with hash 733185942, now seen corresponding path program 1 times [2023-12-16 08:22:35,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808176785] [2023-12-16 08:22:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:35,325 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 08:22:35,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:35,326 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 08:22:35,334 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 08:22:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:35,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 08:22:35,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:40,636 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 08:22:40,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:40,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:40,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808176785] [2023-12-16 08:22:40,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808176785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:40,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:40,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 08:22:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696564687] [2023-12-16 08:22:40,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:40,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 08:22:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 08:22:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-16 08:22:40,639 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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 08:22:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:41,895 INFO L93 Difference]: Finished difference Result 587 states and 909 transitions. [2023-12-16 08:22:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 08:22:41,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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 104 [2023-12-16 08:22:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:41,898 INFO L225 Difference]: With dead ends: 587 [2023-12-16 08:22:41,898 INFO L226 Difference]: Without dead ends: 323 [2023-12-16 08:22:41,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-16 08:22:41,900 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 396 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:41,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 96 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 08:22:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-12-16 08:22:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2023-12-16 08:22:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 322 states have internal predecessors, (418), 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 08:22:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 418 transitions. [2023-12-16 08:22:41,914 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 418 transitions. Word has length 104 [2023-12-16 08:22:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:41,914 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 418 transitions. [2023-12-16 08:22:41,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 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 08:22:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 418 transitions. [2023-12-16 08:22:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 08:22:41,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:41,916 INFO L195 NwaCegarLoop]: trace histogram [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, 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 08:22:41,931 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 08:22:42,118 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 08:22:42,119 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:42,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash 561135710, now seen corresponding path program 1 times [2023-12-16 08:22:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924432756] [2023-12-16 08:22:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:42,120 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 08:22:42,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:42,136 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 08:22:42,138 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 08:22:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:42,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 08:22:42,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:22:44,923 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:44,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924432756] [2023-12-16 08:22:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924432756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:44,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:44,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 08:22:44,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509303702] [2023-12-16 08:22:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:44,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 08:22:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 08:22:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2023-12-16 08:22:44,925 INFO L87 Difference]: Start difference. First operand 323 states and 418 transitions. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 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 08:22:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:47,233 INFO L93 Difference]: Finished difference Result 1047 states and 1452 transitions. [2023-12-16 08:22:47,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 08:22:47,234 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 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 108 [2023-12-16 08:22:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:47,237 INFO L225 Difference]: With dead ends: 1047 [2023-12-16 08:22:47,237 INFO L226 Difference]: Without dead ends: 521 [2023-12-16 08:22:47,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2023-12-16 08:22:47,239 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 410 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2840 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:47,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 71 Invalid, 3038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2840 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-16 08:22:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2023-12-16 08:22:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 519. [2023-12-16 08:22:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.252895752895753) internal successors, (649), 518 states have internal predecessors, (649), 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 08:22:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 649 transitions. [2023-12-16 08:22:47,251 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 649 transitions. Word has length 108 [2023-12-16 08:22:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:47,251 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 649 transitions. [2023-12-16 08:22:47,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 10 states have internal predecessors, (108), 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 08:22:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 649 transitions. [2023-12-16 08:22:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-16 08:22:47,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:47,254 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 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 08:22:47,266 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 08:22:47,456 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 08:22:47,456 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:47,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2056724215, now seen corresponding path program 1 times [2023-12-16 08:22:47,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:47,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610387899] [2023-12-16 08:22:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:47,458 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 08:22:47,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:47,459 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 08:22:47,477 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 08:22:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:47,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:22:47,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 08:22:47,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:47,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:47,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610387899] [2023-12-16 08:22:47,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610387899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:47,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:47,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:47,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419292570] [2023-12-16 08:22:47,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:47,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:22:47,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:47,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:22:47,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:47,537 INFO L87 Difference]: Start difference. First operand 519 states and 649 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 08:22:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:47,932 INFO L93 Difference]: Finished difference Result 1110 states and 1382 transitions. [2023-12-16 08:22:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:47,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2023-12-16 08:22:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:47,935 INFO L225 Difference]: With dead ends: 1110 [2023-12-16 08:22:47,935 INFO L226 Difference]: Without dead ends: 650 [2023-12-16 08:22:47,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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 08:22:47,936 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 159 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:47,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 23 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 08:22:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2023-12-16 08:22:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2023-12-16 08:22:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 1.184899845916795) internal successors, (769), 649 states have internal predecessors, (769), 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 08:22:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 769 transitions. [2023-12-16 08:22:47,951 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 769 transitions. Word has length 127 [2023-12-16 08:22:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:47,951 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 769 transitions. [2023-12-16 08:22:47,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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 08:22:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 769 transitions. [2023-12-16 08:22:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-16 08:22:47,954 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:47,954 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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 08:22:47,959 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 (5)] Forceful destruction successful, exit code 0 [2023-12-16 08:22:48,159 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 08:22:48,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:48,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash 407436198, now seen corresponding path program 1 times [2023-12-16 08:22:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473418123] [2023-12-16 08:22:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:48,161 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 08:22:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:48,166 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 08:22:48,166 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 08:22:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:48,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:48,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-16 08:22:48,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:48,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:48,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473418123] [2023-12-16 08:22:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473418123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:48,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:48,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866683319] [2023-12-16 08:22:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:48,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:22:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:22:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:48,256 INFO L87 Difference]: Start difference. First operand 650 states and 769 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 08:22:48,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:48,679 INFO L93 Difference]: Finished difference Result 1634 states and 1960 transitions. [2023-12-16 08:22:48,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:48,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 138 [2023-12-16 08:22:48,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:48,682 INFO L225 Difference]: With dead ends: 1634 [2023-12-16 08:22:48,682 INFO L226 Difference]: Without dead ends: 912 [2023-12-16 08:22:48,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 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 08:22:48,684 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:48,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 59 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 08:22:48,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2023-12-16 08:22:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 912. [2023-12-16 08:22:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.0954994511525795) internal successors, (998), 911 states have internal predecessors, (998), 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 08:22:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 998 transitions. [2023-12-16 08:22:48,699 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 998 transitions. Word has length 138 [2023-12-16 08:22:48,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:48,699 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 998 transitions. [2023-12-16 08:22:48,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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 08:22:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 998 transitions. [2023-12-16 08:22:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-16 08:22:48,704 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:48,709 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 08:22:48,713 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 (6)] Forceful destruction successful, exit code 0 [2023-12-16 08:22:48,911 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 08:22:48,911 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:48,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2001311302, now seen corresponding path program 1 times [2023-12-16 08:22:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058925058] [2023-12-16 08:22:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:48,914 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 08:22:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:48,915 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 08:22:48,916 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 08:22:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:48,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:48,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-16 08:22:49,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:49,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:49,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058925058] [2023-12-16 08:22:49,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058925058] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:49,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:49,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:49,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183248216] [2023-12-16 08:22:49,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:49,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 08:22:49,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:49,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 08:22:49,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:22:49,071 INFO L87 Difference]: Start difference. First operand 912 states and 998 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 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 08:22:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:49,573 INFO L93 Difference]: Finished difference Result 2420 states and 2656 transitions. [2023-12-16 08:22:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 08:22:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 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 181 [2023-12-16 08:22:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:49,577 INFO L225 Difference]: With dead ends: 2420 [2023-12-16 08:22:49,577 INFO L226 Difference]: Without dead ends: 1436 [2023-12-16 08:22:49,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 178 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 08:22:49,579 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 230 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:49,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 29 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 08:22:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2023-12-16 08:22:49,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2023-12-16 08:22:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1435 states have (on average 1.0891986062717771) internal successors, (1563), 1435 states have internal predecessors, (1563), 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 08:22:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1563 transitions. [2023-12-16 08:22:49,601 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1563 transitions. Word has length 181 [2023-12-16 08:22:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:49,601 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 1563 transitions. [2023-12-16 08:22:49,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 3 states have internal predecessors, (164), 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 08:22:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1563 transitions. [2023-12-16 08:22:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2023-12-16 08:22:49,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:49,604 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:49,622 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 08:22:49,806 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 08:22:49,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:49,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1683116389, now seen corresponding path program 1 times [2023-12-16 08:22:49,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:49,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151861935] [2023-12-16 08:22:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:49,808 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 08:22:49,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:49,809 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 08:22:49,811 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 08:22:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:49,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:49,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-12-16 08:22:49,926 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:49,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151861935] [2023-12-16 08:22:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151861935] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:49,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814760190] [2023-12-16 08:22:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:49,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:22:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:22:49,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:49,929 INFO L87 Difference]: Start difference. First operand 1436 states and 1563 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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 08:22:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:50,243 INFO L93 Difference]: Finished difference Result 3337 states and 3651 transitions. [2023-12-16 08:22:50,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:50,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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 202 [2023-12-16 08:22:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:50,247 INFO L225 Difference]: With dead ends: 3337 [2023-12-16 08:22:50,247 INFO L226 Difference]: Without dead ends: 1829 [2023-12-16 08:22:50,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 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 08:22:50,250 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:50,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 175 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 08:22:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2023-12-16 08:22:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1829. [2023-12-16 08:22:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1828 states have (on average 1.0831509846827134) internal successors, (1980), 1828 states have internal predecessors, (1980), 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 08:22:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 1980 transitions. [2023-12-16 08:22:50,273 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 1980 transitions. Word has length 202 [2023-12-16 08:22:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:50,274 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 1980 transitions. [2023-12-16 08:22:50,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 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 08:22:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 1980 transitions. [2023-12-16 08:22:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2023-12-16 08:22:50,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:50,277 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2023-12-16 08:22:50,291 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 08:22:50,480 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 08:22:50,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:50,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1415990027, now seen corresponding path program 1 times [2023-12-16 08:22:50,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:50,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056915765] [2023-12-16 08:22:50,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:50,482 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 08:22:50,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:50,483 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 08:22:50,499 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 08:22:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:50,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 08:22:50,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 256 proven. 8 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-12-16 08:22:51,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 08:22:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 228 proven. 36 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-12-16 08:22:52,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056915765] [2023-12-16 08:22:52,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056915765] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 08:22:52,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 08:22:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-16 08:22:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903086179] [2023-12-16 08:22:52,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 08:22:52,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 08:22:52,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:52,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 08:22:52,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 08:22:52,224 INFO L87 Difference]: Start difference. First operand 1829 states and 1980 transitions. Second operand has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 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 08:22:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:53,379 INFO L93 Difference]: Finished difference Result 4263 states and 4601 transitions. [2023-12-16 08:22:53,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 08:22:53,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 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 267 [2023-12-16 08:22:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:53,385 INFO L225 Difference]: With dead ends: 4263 [2023-12-16 08:22:53,385 INFO L226 Difference]: Without dead ends: 2493 [2023-12-16 08:22:53,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2023-12-16 08:22:53,388 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1204 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:53,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 71 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 08:22:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2023-12-16 08:22:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1567. [2023-12-16 08:22:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1566 states have (on average 1.08301404853129) internal successors, (1696), 1566 states have internal predecessors, (1696), 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 08:22:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 1696 transitions. [2023-12-16 08:22:53,410 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 1696 transitions. Word has length 267 [2023-12-16 08:22:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:53,410 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 1696 transitions. [2023-12-16 08:22:53,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 6 states have internal predecessors, (257), 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 08:22:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1696 transitions. [2023-12-16 08:22:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2023-12-16 08:22:53,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:53,413 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2023-12-16 08:22:53,419 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 08:22:53,616 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 08:22:53,616 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:53,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1205742900, now seen corresponding path program 1 times [2023-12-16 08:22:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:53,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548028293] [2023-12-16 08:22:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:53,620 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 08:22:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:53,621 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 08:22:53,647 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 08:22:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:53,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:53,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2023-12-16 08:22:53,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:53,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548028293] [2023-12-16 08:22:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548028293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:53,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:53,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408028061] [2023-12-16 08:22:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:53,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 08:22:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:53,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 08:22:53,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 08:22:53,836 INFO L87 Difference]: Start difference. First operand 1567 states and 1696 transitions. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 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 08:22:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:54,442 INFO L93 Difference]: Finished difference Result 3861 states and 4200 transitions. [2023-12-16 08:22:54,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 08:22:54,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 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 289 [2023-12-16 08:22:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:54,447 INFO L225 Difference]: With dead ends: 3861 [2023-12-16 08:22:54,447 INFO L226 Difference]: Without dead ends: 2353 [2023-12-16 08:22:54,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 286 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 08:22:54,450 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 232 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:54,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 28 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 08:22:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2023-12-16 08:22:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2091. [2023-12-16 08:22:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 2090 states have (on average 1.0842105263157895) internal successors, (2266), 2090 states have internal predecessors, (2266), 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 08:22:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 2266 transitions. [2023-12-16 08:22:54,474 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 2266 transitions. Word has length 289 [2023-12-16 08:22:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:54,474 INFO L495 AbstractCegarLoop]: Abstraction has 2091 states and 2266 transitions. [2023-12-16 08:22:54,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 3 states have internal predecessors, (178), 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 08:22:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2266 transitions. [2023-12-16 08:22:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2023-12-16 08:22:54,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:54,478 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2023-12-16 08:22:54,483 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 08:22:54,681 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 08:22:54,681 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:54,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1119859392, now seen corresponding path program 1 times [2023-12-16 08:22:54,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:54,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489096995] [2023-12-16 08:22:54,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:54,686 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 08:22:54,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:54,687 INFO L229 MonitoredProcess]: Starting monitored process 11 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 08:22:54,712 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 (11)] Waiting until timeout for monitored process [2023-12-16 08:22:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:54,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:54,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-12-16 08:22:54,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:54,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:54,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489096995] [2023-12-16 08:22:54,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489096995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:54,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562776706] [2023-12-16 08:22:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:54,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:22:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:54,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:22:54,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:54,853 INFO L87 Difference]: Start difference. First operand 2091 states and 2266 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 08:22:55,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:55,282 INFO L93 Difference]: Finished difference Result 4254 states and 4616 transitions. [2023-12-16 08:22:55,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:55,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 307 [2023-12-16 08:22:55,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:55,298 INFO L225 Difference]: With dead ends: 4254 [2023-12-16 08:22:55,298 INFO L226 Difference]: Without dead ends: 2222 [2023-12-16 08:22:55,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 305 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 08:22:55,309 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 114 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:55,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 103 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 08:22:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2023-12-16 08:22:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2222. [2023-12-16 08:22:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2221 states have (on average 1.0769923457901847) internal successors, (2392), 2221 states have internal predecessors, (2392), 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 08:22:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2392 transitions. [2023-12-16 08:22:55,358 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2392 transitions. Word has length 307 [2023-12-16 08:22:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:55,358 INFO L495 AbstractCegarLoop]: Abstraction has 2222 states and 2392 transitions. [2023-12-16 08:22:55,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 08:22:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2392 transitions. [2023-12-16 08:22:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2023-12-16 08:22:55,374 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:55,374 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-12-16 08:22:55,379 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 (11)] Ended with exit code 0 [2023-12-16 08:22:55,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 08:22:55,579 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:55,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1473257042, now seen corresponding path program 1 times [2023-12-16 08:22:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535986872] [2023-12-16 08:22:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:55,581 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 08:22:55,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:55,582 INFO L229 MonitoredProcess]: Starting monitored process 12 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 08:22:55,584 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 (12)] Waiting until timeout for monitored process [2023-12-16 08:22:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:55,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 08:22:55,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2023-12-16 08:22:55,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:55,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:55,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535986872] [2023-12-16 08:22:55,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535986872] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:55,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:55,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:55,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878270590] [2023-12-16 08:22:55,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:55,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:22:55,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:22:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:55,851 INFO L87 Difference]: Start difference. First operand 2222 states and 2392 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 08:22:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:56,165 INFO L93 Difference]: Finished difference Result 4909 states and 5291 transitions. [2023-12-16 08:22:56,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:56,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 08:22:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:56,171 INFO L225 Difference]: With dead ends: 4909 [2023-12-16 08:22:56,171 INFO L226 Difference]: Without dead ends: 2746 [2023-12-16 08:22:56,173 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 08:22:56,173 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:56,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 162 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 08:22:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2023-12-16 08:22:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2746. [2023-12-16 08:22:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 1.0710382513661203) internal successors, (2940), 2745 states have internal predecessors, (2940), 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 08:22:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 2940 transitions. [2023-12-16 08:22:56,202 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 2940 transitions. Word has length 331 [2023-12-16 08:22:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:56,202 INFO L495 AbstractCegarLoop]: Abstraction has 2746 states and 2940 transitions. [2023-12-16 08:22:56,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 08:22:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 2940 transitions. [2023-12-16 08:22:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2023-12-16 08:22:56,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 08:22:56,206 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2023-12-16 08:22:56,209 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 08:22:56,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 08:22:56,409 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 08:22:56,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 08:22:56,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1494731988, now seen corresponding path program 1 times [2023-12-16 08:22:56,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 08:22:56,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870138860] [2023-12-16 08:22:56,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 08:22:56,411 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 08:22:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 08:22:56,412 INFO L229 MonitoredProcess]: Starting monitored process 13 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 08:22:56,414 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 (13)] Waiting until timeout for monitored process [2023-12-16 08:22:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 08:22:56,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 08:22:56,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 08:22:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-12-16 08:22:56,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 08:22:56,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 08:22:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870138860] [2023-12-16 08:22:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870138860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 08:22:56,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 08:22:56,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 08:22:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442156904] [2023-12-16 08:22:56,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 08:22:56,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 08:22:56,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 08:22:56,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 08:22:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 08:22:56,603 INFO L87 Difference]: Start difference. First operand 2746 states and 2940 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 08:22:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 08:22:56,935 INFO L93 Difference]: Finished difference Result 5431 states and 5800 transitions. [2023-12-16 08:22:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 08:22:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 332 [2023-12-16 08:22:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 08:22:56,936 INFO L225 Difference]: With dead ends: 5431 [2023-12-16 08:22:56,936 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 08:22:56,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 330 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 08:22:56,939 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 96 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 08:22:56,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 153 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 08:22:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 08:22:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 08:22:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 08:22:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 08:22:56,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 332 [2023-12-16 08:22:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 08:22:56,940 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 08:22:56,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 08:22:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 08:22:56,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 08:22:56,942 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 08:22:56,945 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 (13)] Ended with exit code 0 [2023-12-16 08:22:57,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 08:22:57,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,304 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2023-12-16 08:22:57,305 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,306 INFO L899 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2023-12-16 08:22:57,307 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2023-12-16 08:22:57,308 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L587(lines 587 604) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,309 INFO L899 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2023-12-16 08:22:57,310 INFO L899 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L895 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse4 (not (= ~a7~0 (_ bv1 32)))) (.cse3 (= (_ bv1 32) ~a17~0)) (.cse5 (= (_ bv4 32) ~a16~0)) (.cse0 (= (_ bv1 32) ~a20~0)) (.cse6 (= ~a7~0 (_ bv0 32))) (.cse7 (= (_ bv0 32) ~a20~0)) (.cse2 (= (_ bv5 32) ~a16~0))) (or (and .cse0 (let ((.cse1 (not .cse3))) (or (and .cse1 .cse2) (and (= (_ bv6 32) ~a16~0) .cse1))) .cse4) (and .cse0 .cse5 .cse6) (not (= (_ bv8 32) ~a12~0)) (and .cse4 .cse5 (not .cse0) .cse3) (and .cse5 .cse7) (and .cse7 .cse6) (and .cse0 .cse6 .cse2) (not (= ~a8~0 (_ bv15 32))) (and .cse7 .cse2) (not (= (_ bv1 32) ~a21~0)))) [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point calculate_output_returnLabel#1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 501) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2023-12-16 08:22:57,311 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2023-12-16 08:22:57,325 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 08:22:57,326 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 08:22:57,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 08:22:57 BoogieIcfgContainer [2023-12-16 08:22:57,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 08:22:57,334 INFO L158 Benchmark]: Toolchain (without parser) took 24463.33ms. Allocated memory was 179.3MB in the beginning and 544.2MB in the end (delta: 364.9MB). Free memory was 126.3MB in the beginning and 347.8MB in the end (delta: -221.4MB). Peak memory consumption was 144.0MB. Max. memory is 8.0GB. [2023-12-16 08:22:57,334 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 08:22:57,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.84ms. Allocated memory is still 179.3MB. Free memory was 125.8MB in the beginning and 96.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-16 08:22:57,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.62ms. Allocated memory is still 179.3MB. Free memory was 96.4MB in the beginning and 90.2MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 08:22:57,335 INFO L158 Benchmark]: Boogie Preprocessor took 113.62ms. Allocated memory is still 179.3MB. Free memory was 90.2MB in the beginning and 84.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 08:22:57,335 INFO L158 Benchmark]: RCFGBuilder took 1065.88ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 84.9MB in the beginning and 88.4MB in the end (delta: -3.4MB). Peak memory consumption was 44.2MB. Max. memory is 8.0GB. [2023-12-16 08:22:57,335 INFO L158 Benchmark]: TraceAbstraction took 22679.25ms. Allocated memory was 216.0MB in the beginning and 544.2MB in the end (delta: 328.2MB). Free memory was 87.9MB in the beginning and 347.8MB in the end (delta: -259.9MB). Peak memory consumption was 68.3MB. Max. memory is 8.0GB. [2023-12-16 08:22:57,336 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.12ms. Allocated memory is still 179.3MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.84ms. Allocated memory is still 179.3MB. Free memory was 125.8MB in the beginning and 96.5MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.62ms. Allocated memory is still 179.3MB. Free memory was 96.4MB in the beginning and 90.2MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 113.62ms. Allocated memory is still 179.3MB. Free memory was 90.2MB in the beginning and 84.9MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1065.88ms. Allocated memory was 179.3MB in the beginning and 216.0MB in the end (delta: 36.7MB). Free memory was 84.9MB in the beginning and 88.4MB in the end (delta: -3.4MB). Peak memory consumption was 44.2MB. Max. memory is 8.0GB. * TraceAbstraction took 22679.25ms. Allocated memory was 216.0MB in the beginning and 544.2MB in the end (delta: 328.2MB). Free memory was 87.9MB in the beginning and 347.8MB in the end (delta: -259.9MB). Peak memory consumption was 68.3MB. 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 - PositiveResult [Line: 501]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3202 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3202 mSDsluCounter, 1170 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 627 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8047 IncrementalHoareTripleChecker+Invalid, 8674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 627 mSolverCounterUnsat, 1017 mSDtfsCounter, 8047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2757 GetRequests, 2712 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2746occurred in iteration=11, InterpolantAutomatonStates: 69, 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, 12 MinimizatonAttempts, 1190 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 24 NumberOfFragments, 94 HoareAnnotationTreeSize, 1 FormulaSimplifications, 1290 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 163 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 2490 NumberOfCodeBlocks, 2490 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2744 ConstructedInterpolants, 0 QuantifiedInterpolants, 15941 SizeOfPredicates, 22 NumberOfNonLiveVariables, 3535 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 3482/3526 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: ((((((((((((1 == a20) && ((!((1 == a17)) && (5 == a16)) || ((6 == a16) && !((1 == a17))))) && !((a7 == 1))) || (((1 == a20) && (4 == a16)) && (a7 == 0))) || !((8 == a12))) || (((!((a7 == 1)) && (4 == a16)) && !((1 == a20))) && (1 == a17))) || ((4 == a16) && (0 == a20))) || ((0 == a20) && (a7 == 0))) || (((1 == a20) && (a7 == 0)) && (5 == a16))) || !((a8 == 15))) || ((0 == a20) && (5 == a16))) || !((1 == a21))) RESULT: Ultimate proved your program to be correct! [2023-12-16 08:22:57,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...