/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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 00:03:16,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 00:03:16,454 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-24 00:03:16,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 00:03:16,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 00:03:16,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 00:03:16,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 00:03:16,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 00:03:16,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 00:03:16,485 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 00:03:16,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 00:03:16,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 00:03:16,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 00:03:16,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 00:03:16,487 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 00:03:16,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 00:03:16,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 00:03:16,487 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 00:03:16,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 00:03:16,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 00:03:16,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 00:03:16,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 00:03:16,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 00:03:16,489 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 00:03:16,489 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 00:03:16,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 00:03:16,490 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 00:03:16,490 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 00:03:16,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 00:03:16,490 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 00:03:16,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 00:03:16,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 00:03:16,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 00:03:16,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 00:03:16,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 00:03:16,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 00:03:16,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 00:03:16,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 00:03:16,492 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 00:03:16,492 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 00:03:16,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 00:03:16,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 00:03:16,492 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 00:03:16,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 00:03:16,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 00:03:16,493 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 00:03:16,493 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-24 00:03:16,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 00:03:16,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 00:03:16,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 00:03:16,711 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 00:03:16,714 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 00:03:16,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i [2023-12-24 00:03:18,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 00:03:18,253 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 00:03:18,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i [2023-12-24 00:03:18,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ce6da86/4d3833e282254e84af92eb8ef057bf81/FLAG94d2ec0d2 [2023-12-24 00:03:18,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ce6da86/4d3833e282254e84af92eb8ef057bf81 [2023-12-24 00:03:18,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 00:03:18,279 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 00:03:18,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 00:03:18,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 00:03:18,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 00:03:18,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b4aea3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18, skipping insertion in model container [2023-12-24 00:03:18,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 00:03:18,399 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928] [2023-12-24 00:03:18,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 00:03:18,445 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 00:03:18,454 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-21.i[915,928] [2023-12-24 00:03:18,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 00:03:18,487 INFO L206 MainTranslator]: Completed translation [2023-12-24 00:03:18,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18 WrapperNode [2023-12-24 00:03:18,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 00:03:18,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 00:03:18,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 00:03:18,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 00:03:18,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,518 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2023-12-24 00:03:18,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 00:03:18,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 00:03:18,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 00:03:18,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 00:03:18,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,546 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-24 00:03:18,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,556 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 00:03:18,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 00:03:18,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 00:03:18,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 00:03:18,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (1/1) ... [2023-12-24 00:03:18,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 00:03:18,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 00:03:18,590 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-24 00:03:18,628 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-24 00:03:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 00:03:18,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 00:03:18,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 00:03:18,651 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 00:03:18,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 00:03:18,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 00:03:18,734 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 00:03:18,738 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 00:03:18,941 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 00:03:19,008 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 00:03:19,008 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 00:03:19,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:03:19 BoogieIcfgContainer [2023-12-24 00:03:19,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 00:03:19,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 00:03:19,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 00:03:19,016 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 00:03:19,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 12:03:18" (1/3) ... [2023-12-24 00:03:19,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63774d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:03:19, skipping insertion in model container [2023-12-24 00:03:19,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 12:03:18" (2/3) ... [2023-12-24 00:03:19,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63774d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 12:03:19, skipping insertion in model container [2023-12-24 00:03:19,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 12:03:19" (3/3) ... [2023-12-24 00:03:19,018 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-21.i [2023-12-24 00:03:19,034 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 00:03:19,035 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 00:03:19,088 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 00:03:19,093 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;@37c0ebcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 00:03:19,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 00:03:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 00:03:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-24 00:03:19,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:03:19,105 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:03:19,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:03:19,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:03:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1810277985, now seen corresponding path program 1 times [2023-12-24 00:03:19,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:03:19,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474712465] [2023-12-24 00:03:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:03:19,139 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-24 00:03:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:03:19,141 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-24 00:03:19,150 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-24 00:03:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:03:19,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 00:03:19,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:03:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 00:03:19,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:03:19,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:03:19,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474712465] [2023-12-24 00:03:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474712465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:03:19,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:03:19,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 00:03:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731407094] [2023-12-24 00:03:19,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:03:19,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 00:03:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:03:19,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 00:03:19,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 00:03:19,550 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:03:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:03:19,836 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2023-12-24 00:03:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 00:03:19,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-24 00:03:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:03:19,844 INFO L225 Difference]: With dead ends: 115 [2023-12-24 00:03:19,845 INFO L226 Difference]: Without dead ends: 75 [2023-12-24 00:03:19,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 00:03:19,850 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 00:03:19,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 145 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 00:03:19,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-24 00:03:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-12-24 00:03:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 00:03:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2023-12-24 00:03:19,909 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 60 [2023-12-24 00:03:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:03:19,910 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2023-12-24 00:03:19,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:03:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2023-12-24 00:03:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-24 00:03:19,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:03:19,914 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:03:19,924 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-24 00:03:20,120 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-24 00:03:20,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:03:20,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:03:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1812125027, now seen corresponding path program 1 times [2023-12-24 00:03:20,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:03:20,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379957622] [2023-12-24 00:03:20,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:03:20,122 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-24 00:03:20,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:03:20,123 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-24 00:03:20,127 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-24 00:03:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:03:20,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 00:03:20,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:03:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 00:03:57,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:03:57,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:03:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379957622] [2023-12-24 00:03:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379957622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:03:57,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:03:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 00:03:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112153062] [2023-12-24 00:03:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:03:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 00:03:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:03:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 00:03:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 00:03:57,367 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:03:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:03:57,807 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2023-12-24 00:03:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 00:03:57,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-24 00:03:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:03:57,809 INFO L225 Difference]: With dead ends: 114 [2023-12-24 00:03:57,810 INFO L226 Difference]: Without dead ends: 112 [2023-12-24 00:03:57,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 00:03:57,811 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 45 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 00:03:57,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 172 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 00:03:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-24 00:03:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2023-12-24 00:03:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 00:03:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2023-12-24 00:03:57,825 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 60 [2023-12-24 00:03:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:03:57,825 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2023-12-24 00:03:57,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:03:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2023-12-24 00:03:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-24 00:03:57,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:03:57,826 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:03:57,841 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-24 00:03:58,033 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-24 00:03:58,034 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:03:58,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:03:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1413417425, now seen corresponding path program 1 times [2023-12-24 00:03:58,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:03:58,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558765688] [2023-12-24 00:03:58,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:03:58,035 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-24 00:03:58,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:03:58,041 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-24 00:03:58,046 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-24 00:03:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:03:58,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 00:03:58,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:04:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 00:04:35,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:04:35,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:04:35,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558765688] [2023-12-24 00:04:35,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558765688] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:04:35,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:04:35,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 00:04:35,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991582781] [2023-12-24 00:04:35,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:04:35,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 00:04:35,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:04:35,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 00:04:35,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 00:04:35,605 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:04:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:04:36,727 INFO L93 Difference]: Finished difference Result 113 states and 154 transitions. [2023-12-24 00:04:36,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 00:04:36,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2023-12-24 00:04:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:04:36,729 INFO L225 Difference]: With dead ends: 113 [2023-12-24 00:04:36,729 INFO L226 Difference]: Without dead ends: 111 [2023-12-24 00:04:36,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-24 00:04:36,730 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 60 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 00:04:36,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 170 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 00:04:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-24 00:04:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2023-12-24 00:04:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 00:04:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2023-12-24 00:04:36,744 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 61 [2023-12-24 00:04:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:04:36,745 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2023-12-24 00:04:36,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:04:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2023-12-24 00:04:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-24 00:04:36,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:04:36,746 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:04:36,753 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 (4)] Forceful destruction successful, exit code 0 [2023-12-24 00:04:36,952 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-24 00:04:36,953 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:04:36,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:04:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash 332200332, now seen corresponding path program 1 times [2023-12-24 00:04:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:04:36,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117435333] [2023-12-24 00:04:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:04:36,954 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-24 00:04:36,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:04:36,956 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-24 00:04:36,961 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-24 00:04:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:04:37,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 00:04:37,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:05:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 00:05:09,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:05:09,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:05:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117435333] [2023-12-24 00:05:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117435333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:05:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:05:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 00:05:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392173400] [2023-12-24 00:05:09,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:05:09,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 00:05:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:05:09,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 00:05:09,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-24 00:05:09,619 INFO L87 Difference]: Start difference. First operand 102 states and 142 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:05:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:05:10,104 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2023-12-24 00:05:10,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 00:05:10,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2023-12-24 00:05:10,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:05:10,106 INFO L225 Difference]: With dead ends: 124 [2023-12-24 00:05:10,107 INFO L226 Difference]: Without dead ends: 122 [2023-12-24 00:05:10,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-24 00:05:10,108 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 00:05:10,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 00:05:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-12-24 00:05:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2023-12-24 00:05:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 00:05:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2023-12-24 00:05:10,125 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 61 [2023-12-24 00:05:10,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:05:10,126 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2023-12-24 00:05:10,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:05:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2023-12-24 00:05:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-24 00:05:10,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:05:10,128 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:05:10,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-24 00:05:10,333 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-24 00:05:10,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:05:10,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:05:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash 332259914, now seen corresponding path program 1 times [2023-12-24 00:05:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:05:10,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460707615] [2023-12-24 00:05:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:05:10,335 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-24 00:05:10,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:05:10,338 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-24 00:05:10,340 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-24 00:05:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:05:10,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 00:05:10,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:05:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 00:05:20,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:05:20,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:05:20,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460707615] [2023-12-24 00:05:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460707615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:05:20,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:05:20,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 00:05:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985884450] [2023-12-24 00:05:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:05:20,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 00:05:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:05:20,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 00:05:20,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-24 00:05:20,635 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:05:21,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:05:21,092 INFO L93 Difference]: Finished difference Result 122 states and 164 transitions. [2023-12-24 00:05:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 00:05:21,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 61 [2023-12-24 00:05:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:05:21,095 INFO L225 Difference]: With dead ends: 122 [2023-12-24 00:05:21,095 INFO L226 Difference]: Without dead ends: 120 [2023-12-24 00:05:21,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-24 00:05:21,102 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 00:05:21,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 169 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 00:05:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-24 00:05:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2023-12-24 00:05:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 00:05:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2023-12-24 00:05:21,127 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 61 [2023-12-24 00:05:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:05:21,128 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2023-12-24 00:05:21,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:05:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2023-12-24 00:05:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-24 00:05:21,129 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:05:21,130 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:05:21,137 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-24 00:05:21,335 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-24 00:05:21,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:05:21,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:05:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 857166558, now seen corresponding path program 1 times [2023-12-24 00:05:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:05:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899131297] [2023-12-24 00:05:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:05:21,337 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-24 00:05:21,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:05:21,338 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-24 00:05:21,340 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-24 00:05:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:05:21,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 00:05:21,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:05:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 00:05:52,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:05:52,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:05:52,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899131297] [2023-12-24 00:05:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899131297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:05:52,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:05:52,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 00:05:52,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313674979] [2023-12-24 00:05:52,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:05:52,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 00:05:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:05:52,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 00:05:52,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-24 00:05:52,349 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:05:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:05:53,769 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2023-12-24 00:05:53,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 00:05:53,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2023-12-24 00:05:53,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:05:53,772 INFO L225 Difference]: With dead ends: 118 [2023-12-24 00:05:53,772 INFO L226 Difference]: Without dead ends: 116 [2023-12-24 00:05:53,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-12-24 00:05:53,773 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 44 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 00:05:53,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 183 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 00:05:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-24 00:05:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 104. [2023-12-24 00:05:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 00:05:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2023-12-24 00:05:53,785 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 62 [2023-12-24 00:05:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:05:53,785 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2023-12-24 00:05:53,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:05:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2023-12-24 00:05:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-24 00:05:53,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:05:53,787 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 00:05:53,800 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-24 00:05:54,002 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-24 00:05:54,003 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:05:54,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:05:54,003 INFO L85 PathProgramCache]: Analyzing trace with hash 857226140, now seen corresponding path program 1 times [2023-12-24 00:05:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:05:54,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208237570] [2023-12-24 00:05:54,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:05:54,004 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-24 00:05:54,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:05:54,006 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-24 00:05:54,009 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-24 00:05:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:05:54,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 00:05:54,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:06:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-24 00:06:10,892 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 00:06:10,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:06:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208237570] [2023-12-24 00:06:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208237570] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 00:06:10,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 00:06:10,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 00:06:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532913841] [2023-12-24 00:06:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 00:06:10,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 00:06:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:06:10,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 00:06:10,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-24 00:06:10,895 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:06:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:06:12,445 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2023-12-24 00:06:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 00:06:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 62 [2023-12-24 00:06:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:06:12,447 INFO L225 Difference]: With dead ends: 116 [2023-12-24 00:06:12,447 INFO L226 Difference]: Without dead ends: 114 [2023-12-24 00:06:12,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-12-24 00:06:12,448 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 36 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 00:06:12,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 200 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 00:06:12,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-24 00:06:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2023-12-24 00:06:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 00:06:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2023-12-24 00:06:12,458 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 62 [2023-12-24 00:06:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:06:12,459 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2023-12-24 00:06:12,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-24 00:06:12,459 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2023-12-24 00:06:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 00:06:12,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 00:06:12,461 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 00:06:12,474 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 (8)] Ended with exit code 0 [2023-12-24 00:06:12,667 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-24 00:06:12,668 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 00:06:12,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 00:06:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1089466452, now seen corresponding path program 1 times [2023-12-24 00:06:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 00:06:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223786915] [2023-12-24 00:06:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 00:06:12,669 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-24 00:06:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 00:06:12,671 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-24 00:06:12,673 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-24 00:06:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 00:06:12,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 00:06:12,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 00:06:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 345 proven. 1 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-12-24 00:06:12,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 00:06:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 00:06:12,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 00:06:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223786915] [2023-12-24 00:06:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223786915] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 00:06:12,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 00:06:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 00:06:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449761324] [2023-12-24 00:06:12,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 00:06:12,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 00:06:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 00:06:12,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 00:06:12,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:06:12,954 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2023-12-24 00:06:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 00:06:13,053 INFO L93 Difference]: Finished difference Result 108 states and 150 transitions. [2023-12-24 00:06:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 00:06:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 119 [2023-12-24 00:06:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 00:06:13,054 INFO L225 Difference]: With dead ends: 108 [2023-12-24 00:06:13,055 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 00:06:13,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 00:06:13,056 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 00:06:13,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 00:06:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 00:06:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 00:06:13,057 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-24 00:06:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 00:06:13,057 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2023-12-24 00:06:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 00:06:13,057 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 00:06:13,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2023-12-24 00:06:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 00:06:13,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 00:06:13,060 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 00:06:13,066 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-24 00:06:13,266 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-24 00:06:13,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 00:06:14,076 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (or (fp.leq ~var_1_12~0 ~var_1_13~0) (and (fp.lt ~var_1_11~0 ~var_1_12~0) (fp.leq ~var_1_11~0 ~var_1_13~0))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,076 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (or (fp.leq ~var_1_12~0 ~var_1_13~0) (and (fp.lt ~var_1_11~0 ~var_1_12~0) (fp.leq ~var_1_11~0 ~var_1_13~0))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,076 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 00:06:14,076 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 00:06:14,076 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 00:06:14,076 INFO L899 garLoopResultBuilder]: For program point L77(lines 62 78) no Hoare annotation was computed. [2023-12-24 00:06:14,076 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point L49-2(lines 36 61) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point L74-1(line 74) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 00:06:14,077 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 00:06:14,078 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (or (fp.leq ~var_1_12~0 ~var_1_13~0) (and (fp.lt ~var_1_11~0 ~var_1_12~0) (fp.leq ~var_1_11~0 ~var_1_13~0))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,078 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (or (fp.leq ~var_1_12~0 ~var_1_13~0) (and (fp.lt ~var_1_11~0 ~var_1_12~0) (fp.leq ~var_1_11~0 ~var_1_13~0))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,078 INFO L895 garLoopResultBuilder]: At program point L92-3(lines 92 98) the Hoare annotation is: (or (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (or (fp.leq ~var_1_12~0 ~var_1_13~0) (and (fp.lt ~var_1_11~0 ~var_1_12~0) (fp.leq ~var_1_11~0 ~var_1_13~0))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv1 32))) [2023-12-24 00:06:14,078 INFO L899 garLoopResultBuilder]: For program point L92-4(lines 92 98) no Hoare annotation was computed. [2023-12-24 00:06:14,078 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 57) no Hoare annotation was computed. [2023-12-24 00:06:14,078 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,078 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,078 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (= (bvadd ~last_1_var_1_8~0 (_ bv32 8)) (_ bv0 8)) (= (_ bv0 8) (bvadd ~var_1_8~0 (_ bv32 8))) (= (_ bv2 8) ~var_1_10~0) (= |ULTIMATE.start_main_~k_loop~0#1| (_ bv0 32)) (= ~last_1_var_1_10~0 (_ bv2 8))) [2023-12-24 00:06:14,078 INFO L899 garLoopResultBuilder]: For program point L72-1(line 72) no Hoare annotation was computed. [2023-12-24 00:06:14,078 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2023-12-24 00:06:14,078 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2023-12-24 00:06:14,079 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-24 00:06:14,079 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 00:06:14,079 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 00:06:14,079 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 00:06:14,079 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 00:06:14,081 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 00:06:14,083 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 00:06:14,092 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.leq~64 [2023-12-24 00:06:14,094 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.lt~64 [2023-12-24 00:06:14,094 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.leq~64 [2023-12-24 00:06:14,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 12:06:14 BoogieIcfgContainer [2023-12-24 00:06:14,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 00:06:14,096 INFO L158 Benchmark]: Toolchain (without parser) took 175816.50ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 124.6MB in the beginning and 719.7MB in the end (delta: -595.1MB). Peak memory consumption was 438.3MB. Max. memory is 8.0GB. [2023-12-24 00:06:14,096 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 176.2MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 00:06:14,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.95ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 111.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-24 00:06:14,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.86ms. Allocated memory is still 176.2MB. Free memory was 111.2MB in the beginning and 109.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 00:06:14,097 INFO L158 Benchmark]: Boogie Preprocessor took 41.39ms. Allocated memory is still 176.2MB. Free memory was 109.1MB in the beginning and 106.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 00:06:14,097 INFO L158 Benchmark]: RCFGBuilder took 448.00ms. Allocated memory was 176.2MB in the beginning and 265.3MB in the end (delta: 89.1MB). Free memory was 106.5MB in the beginning and 234.0MB in the end (delta: -127.5MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. [2023-12-24 00:06:14,097 INFO L158 Benchmark]: TraceAbstraction took 175084.69ms. Allocated memory was 265.3MB in the beginning and 1.2GB in the end (delta: 942.7MB). Free memory was 233.3MB in the beginning and 719.7MB in the end (delta: -486.4MB). Peak memory consumption was 455.9MB. Max. memory is 8.0GB. [2023-12-24 00:06:14,100 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.52ms. Allocated memory is still 176.2MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.95ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 111.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.86ms. Allocated memory is still 176.2MB. Free memory was 111.2MB in the beginning and 109.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.39ms. Allocated memory is still 176.2MB. Free memory was 109.1MB in the beginning and 106.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.00ms. Allocated memory was 176.2MB in the beginning and 265.3MB in the end (delta: 89.1MB). Free memory was 106.5MB in the beginning and 234.0MB in the end (delta: -127.5MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. * TraceAbstraction took 175084.69ms. Allocated memory was 265.3MB in the beginning and 1.2GB in the end (delta: 942.7MB). Free memory was 233.3MB in the beginning and 719.7MB in the end (delta: -486.4MB). Peak memory consumption was 455.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.leq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.lt~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.leq~64 * 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: 19]: 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 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 175.0s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 341 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 1324 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1003 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1027 IncrementalHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 321 mSDtfsCounter, 1027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 673 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 96 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 46 PreInvPairs, 58 NumberOfFragments, 260 HoareAnnotationTreeSize, 46 FormulaSimplifications, 8709 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FormulaSimplificationsInter, 101 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 165.5s InterpolantComputationTime, 546 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 656 ConstructedInterpolants, 0 QuantifiedInterpolants, 4638 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1002 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 2274/2276 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: 92]: Loop Invariant Derived loop invariant: ((((((((last_1_var_1_8 + 32) % 256) == 0) && (0 == ((var_1_8 + 32) % 256))) && (2 == var_1_10)) && (k_loop == 0)) && (last_1_var_1_10 == 2)) || (k_loop == 1)) RESULT: Ultimate proved your program to be correct! [2023-12-24 00:06:14,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...