/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_operatoramount_amount10_file-22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 14:36:29,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 14:36:29,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 14:36:29,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 14:36:29,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 14:36:29,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 14:36:29,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 14:36:29,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 14:36:29,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 14:36:29,871 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 14:36:29,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 14:36:29,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 14:36:29,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 14:36:29,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 14:36:29,873 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 14:36:29,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 14:36:29,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 14:36:29,874 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 14:36:29,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 14:36:29,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 14:36:29,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 14:36:29,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 14:36:29,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 14:36:29,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 14:36:29,876 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 14:36:29,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 14:36:29,876 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 14:36:29,876 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 14:36:29,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 14:36:29,877 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 14:36:29,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 14:36:29,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 14:36:29,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 14:36:29,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 14:36:29,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:36:29,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 14:36:29,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 14:36:29,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 14:36:29,878 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 14:36:29,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 14:36:29,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 14:36:29,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 14:36:29,879 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 14:36:29,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 14:36:29,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 14:36:29,880 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 14:36:29,880 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 14:36:30,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 14:36:30,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 14:36:30,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 14:36:30,099 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 14:36:30,099 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 14:36:30,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2023-12-16 14:36:31,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 14:36:31,388 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 14:36:31,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2023-12-16 14:36:31,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb845cb2/aec2ab19f2f64cd8a158667c0d851558/FLAGe0510d446 [2023-12-16 14:36:31,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdb845cb2/aec2ab19f2f64cd8a158667c0d851558 [2023-12-16 14:36:31,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 14:36:31,407 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 14:36:31,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 14:36:31,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 14:36:31,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 14:36:31,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724f2359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31, skipping insertion in model container [2023-12-16 14:36:31,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,433 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 14:36:31,554 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_operatoramount_amount10_file-22.i[915,928] [2023-12-16 14:36:31,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:36:31,601 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 14:36:31,612 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_operatoramount_amount10_file-22.i[915,928] [2023-12-16 14:36:31,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 14:36:31,642 INFO L206 MainTranslator]: Completed translation [2023-12-16 14:36:31,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31 WrapperNode [2023-12-16 14:36:31,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 14:36:31,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 14:36:31,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 14:36:31,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 14:36:31,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,681 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 62 [2023-12-16 14:36:31,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 14:36:31,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 14:36:31,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 14:36:31,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 14:36:31,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,707 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 14:36:31,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 14:36:31,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 14:36:31,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 14:36:31,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 14:36:31,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (1/1) ... [2023-12-16 14:36:31,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 14:36:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 14:36:31,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 14:36:31,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 14:36:31,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 14:36:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 14:36:31,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 14:36:31,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 14:36:31,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 14:36:31,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 14:36:31,876 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 14:36:31,879 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 14:36:32,168 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 14:36:32,196 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 14:36:32,196 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 14:36:32,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:36:32 BoogieIcfgContainer [2023-12-16 14:36:32,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 14:36:32,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 14:36:32,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 14:36:32,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 14:36:32,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 02:36:31" (1/3) ... [2023-12-16 14:36:32,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2636cb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:36:32, skipping insertion in model container [2023-12-16 14:36:32,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 02:36:31" (2/3) ... [2023-12-16 14:36:32,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2636cb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 02:36:32, skipping insertion in model container [2023-12-16 14:36:32,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 02:36:32" (3/3) ... [2023-12-16 14:36:32,202 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2023-12-16 14:36:32,213 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 14:36:32,213 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 14:36:32,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 14:36:32,245 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;@46d541c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 14:36:32,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 14:36:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 14:36:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 14:36:32,253 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:32,253 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:32,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:32,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash 184138740, now seen corresponding path program 1 times [2023-12-16 14:36:32,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:32,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050082381] [2023-12-16 14:36:32,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:32,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:32,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:32,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 14:36:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:32,560 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 14:36:32,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 14:36:32,580 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:36:32,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:36:32,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050082381] [2023-12-16 14:36:32,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050082381] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:36:32,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:36:32,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 14:36:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122488299] [2023-12-16 14:36:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:36:32,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 14:36:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:36:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 14:36:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 14:36:32,604 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:36:32,662 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2023-12-16 14:36:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 14:36:32,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2023-12-16 14:36:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:36:32,672 INFO L225 Difference]: With dead ends: 47 [2023-12-16 14:36:32,672 INFO L226 Difference]: Without dead ends: 23 [2023-12-16 14:36:32,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 14:36:32,676 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 14:36:32,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 14:36:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-16 14:36:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-16 14:36:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 14:36:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2023-12-16 14:36:32,706 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 36 [2023-12-16 14:36:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:36:32,706 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2023-12-16 14:36:32,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2023-12-16 14:36:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 14:36:32,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:32,708 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:32,729 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 (2)] Ended with exit code 0 [2023-12-16 14:36:32,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:32,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:32,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:32,915 INFO L85 PathProgramCache]: Analyzing trace with hash 343834486, now seen corresponding path program 1 times [2023-12-16 14:36:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:32,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274961777] [2023-12-16 14:36:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:32,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:32,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:32,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:32,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 14:36:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:33,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 14:36:33,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 14:36:33,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:36:33,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:36:33,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274961777] [2023-12-16 14:36:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274961777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:36:33,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:36:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 14:36:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178861810] [2023-12-16 14:36:33,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:36:33,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 14:36:33,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:36:33,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 14:36:33,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 14:36:33,295 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:36:33,616 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2023-12-16 14:36:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 14:36:33,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2023-12-16 14:36:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:36:33,619 INFO L225 Difference]: With dead ends: 67 [2023-12-16 14:36:33,619 INFO L226 Difference]: Without dead ends: 45 [2023-12-16 14:36:33,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 14:36:33,620 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 14:36:33,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 14:36:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-16 14:36:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2023-12-16 14:36:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:36:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2023-12-16 14:36:33,629 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 36 [2023-12-16 14:36:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:36:33,630 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-12-16 14:36:33,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2023-12-16 14:36:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 14:36:33,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:33,631 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:33,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 14:36:33,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:33,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:33,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash 343894068, now seen corresponding path program 1 times [2023-12-16 14:36:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:33,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900405730] [2023-12-16 14:36:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:33,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:33,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 14:36:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:33,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 14:36:33,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 14:36:34,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:36:34,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:36:34,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900405730] [2023-12-16 14:36:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900405730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:36:34,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:36:34,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 14:36:34,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501400833] [2023-12-16 14:36:34,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:36:34,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 14:36:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:36:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 14:36:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 14:36:34,570 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:36:35,049 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-12-16 14:36:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 14:36:35,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2023-12-16 14:36:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:36:35,051 INFO L225 Difference]: With dead ends: 52 [2023-12-16 14:36:35,051 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 14:36:35,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 14:36:35,052 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 14:36:35,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 14:36:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 14:36:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2023-12-16 14:36:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:36:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2023-12-16 14:36:35,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 36 [2023-12-16 14:36:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:36:35,058 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2023-12-16 14:36:35,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2023-12-16 14:36:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 14:36:35,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:35,059 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:35,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 14:36:35,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:35,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:35,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1832132531, now seen corresponding path program 1 times [2023-12-16 14:36:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:35,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833306400] [2023-12-16 14:36:35,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:35,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:35,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:35,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:35,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 14:36:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:35,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 14:36:35,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 14:36:35,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:36:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 14:36:35,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:36:35,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833306400] [2023-12-16 14:36:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833306400] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 14:36:35,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 14:36:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-16 14:36:35,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101697083] [2023-12-16 14:36:35,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 14:36:35,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 14:36:35,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:36:35,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 14:36:35,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 14:36:35,505 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 14:36:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:36:35,774 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2023-12-16 14:36:35,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 14:36:35,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 37 [2023-12-16 14:36:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:36:35,779 INFO L225 Difference]: With dead ends: 100 [2023-12-16 14:36:35,779 INFO L226 Difference]: Without dead ends: 55 [2023-12-16 14:36:35,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-16 14:36:35,780 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 14:36:35,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 14:36:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-16 14:36:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2023-12-16 14:36:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 14:36:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2023-12-16 14:36:35,785 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 37 [2023-12-16 14:36:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:36:35,785 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2023-12-16 14:36:35,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-16 14:36:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2023-12-16 14:36:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 14:36:35,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:35,786 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:35,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 14:36:36,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:36,002 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:36,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1830225907, now seen corresponding path program 1 times [2023-12-16 14:36:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:36,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993375558] [2023-12-16 14:36:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:36,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:36,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:36,006 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:36,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 14:36:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:36,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 14:36:36,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 14:36:37,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:36:37,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:36:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993375558] [2023-12-16 14:36:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993375558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:36:37,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:36:37,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 14:36:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896307780] [2023-12-16 14:36:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:36:37,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 14:36:37,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:36:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 14:36:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 14:36:37,602 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:36:38,593 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2023-12-16 14:36:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 14:36:38,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2023-12-16 14:36:38,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:36:38,601 INFO L225 Difference]: With dead ends: 98 [2023-12-16 14:36:38,602 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 14:36:38,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2023-12-16 14:36:38,602 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 64 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 14:36:38,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 93 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 14:36:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 14:36:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 68. [2023-12-16 14:36:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 14:36:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2023-12-16 14:36:38,612 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 37 [2023-12-16 14:36:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:36:38,612 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2023-12-16 14:36:38,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2023-12-16 14:36:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 14:36:38,613 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:38,613 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:38,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 14:36:38,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:38,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:38,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:38,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1830285489, now seen corresponding path program 1 times [2023-12-16 14:36:38,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:38,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372702940] [2023-12-16 14:36:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:38,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:38,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:38,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 14:36:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:38,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 14:36:38,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 14:36:39,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 14:36:46,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:36:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372702940] [2023-12-16 14:36:46,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372702940] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 14:36:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [659966845] [2023-12-16 14:36:46,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:46,026 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 14:36:46,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 14:36:46,217 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 14:36:46,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-16 14:36:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:46,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 14:36:46,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 14:36:51,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:36:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [659966845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:36:51,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 14:36:51,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-12-16 14:36:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859748957] [2023-12-16 14:36:51,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:36:51,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 14:36:51,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:36:51,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 14:36:51,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-12-16 14:36:51,767 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:36:55,179 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-12-16 14:36:55,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 14:36:55,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2023-12-16 14:36:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:36:55,181 INFO L225 Difference]: With dead ends: 78 [2023-12-16 14:36:55,181 INFO L226 Difference]: Without dead ends: 76 [2023-12-16 14:36:55,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2023-12-16 14:36:55,182 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 14:36:55,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 77 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 14:36:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-16 14:36:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2023-12-16 14:36:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 14:36:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2023-12-16 14:36:55,188 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2023-12-16 14:36:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:36:55,188 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2023-12-16 14:36:55,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2023-12-16 14:36:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 14:36:55,189 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:55,189 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:55,194 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 (7)] Ended with exit code 0 [2023-12-16 14:36:55,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-16 14:36:55,599 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 14:36:55,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:55,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1519236361, now seen corresponding path program 1 times [2023-12-16 14:36:55,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:55,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027157988] [2023-12-16 14:36:55,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:55,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:55,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:55,601 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:55,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 14:36:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:55,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 14:36:55,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:36:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2023-12-16 14:36:57,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:36:57,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:36:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027157988] [2023-12-16 14:36:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027157988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:36:57,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:36:57,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 14:36:57,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763863011] [2023-12-16 14:36:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:36:57,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 14:36:57,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:36:57,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 14:36:57,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 14:36:57,366 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:36:57,884 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-12-16 14:36:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 14:36:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 72 [2023-12-16 14:36:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:36:57,886 INFO L225 Difference]: With dead ends: 79 [2023-12-16 14:36:57,886 INFO L226 Difference]: Without dead ends: 77 [2023-12-16 14:36:57,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 14:36:57,887 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 14:36:57,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 14:36:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-16 14:36:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2023-12-16 14:36:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 14:36:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2023-12-16 14:36:57,893 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 72 [2023-12-16 14:36:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:36:57,893 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2023-12-16 14:36:57,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:36:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2023-12-16 14:36:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 14:36:57,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:36:57,901 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:36:57,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 14:36:58,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:58,102 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:36:58,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:36:58,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1519176779, now seen corresponding path program 1 times [2023-12-16 14:36:58,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:36:58,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279677073] [2023-12-16 14:36:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:36:58,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:36:58,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:36:58,108 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:36:58,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 14:36:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:36:58,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 14:36:58,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:37:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-12-16 14:37:01,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:37:01,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:37:01,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279677073] [2023-12-16 14:37:01,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279677073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:37:01,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:37:01,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 14:37:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510869716] [2023-12-16 14:37:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:37:01,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 14:37:01,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:37:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 14:37:01,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 14:37:01,742 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 14:37:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:37:02,509 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2023-12-16 14:37:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 14:37:02,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2023-12-16 14:37:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:37:02,517 INFO L225 Difference]: With dead ends: 140 [2023-12-16 14:37:02,517 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 14:37:02,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 14:37:02,518 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 14:37:02,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 14:37:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 14:37:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2023-12-16 14:37:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-16 14:37:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2023-12-16 14:37:02,546 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 72 [2023-12-16 14:37:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:37:02,546 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2023-12-16 14:37:02,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-16 14:37:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2023-12-16 14:37:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-16 14:37:02,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 14:37:02,547 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:37:02,555 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 (10)] Ended with exit code 0 [2023-12-16 14:37:02,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:37:02,748 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 14:37:02,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 14:37:02,748 INFO L85 PathProgramCache]: Analyzing trace with hash 930423351, now seen corresponding path program 1 times [2023-12-16 14:37:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 14:37:02,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391916608] [2023-12-16 14:37:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 14:37:02,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:37:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 14:37:02,750 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 14:37:02,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 14:37:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 14:37:02,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 14:37:02,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 14:37:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2023-12-16 14:37:04,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 14:37:04,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 14:37:04,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391916608] [2023-12-16 14:37:04,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391916608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 14:37:04,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 14:37:04,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 14:37:04,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494957110] [2023-12-16 14:37:04,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 14:37:04,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 14:37:04,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 14:37:04,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 14:37:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 14:37:04,148 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:37:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 14:37:05,494 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2023-12-16 14:37:05,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 14:37:05,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 72 [2023-12-16 14:37:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 14:37:05,495 INFO L225 Difference]: With dead ends: 99 [2023-12-16 14:37:05,495 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 14:37:05,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 14:37:05,496 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 14:37:05,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 83 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 14:37:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 14:37:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 14:37:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 14:37:05,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 14:37:05,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2023-12-16 14:37:05,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 14:37:05,497 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 14:37:05,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 14:37:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 14:37:05,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 14:37:05,508 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 14:37:05,513 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 14:37:05,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 14:37:05,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 14:37:08,647 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 35) no Hoare annotation was computed. [2023-12-16 14:37:08,647 INFO L899 garLoopResultBuilder]: For program point L31-1(lines 30 39) no Hoare annotation was computed. [2023-12-16 14:37:08,647 INFO L895 garLoopResultBuilder]: At program point L60-2(lines 60 66) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 (fp.neg .cse0)) (fp.geq ~var_1_6~0 (fp.neg .cse1))) (and (fp.geq ~var_1_6~0 .cse0) (fp.leq ~var_1_6~0 .cse1)))) (bvsle ((_ zero_extend 24) ~var_1_3~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:08,647 INFO L899 garLoopResultBuilder]: For program point L60-3(lines 60 66) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 (fp.neg .cse0)) (fp.geq ~var_1_6~0 (fp.neg .cse1))) (and (fp.geq ~var_1_6~0 .cse0) (fp.leq ~var_1_6~0 .cse1)))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:08,648 INFO L895 garLoopResultBuilder]: At program point L44-1(line 44) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 (fp.neg .cse0)) (fp.geq ~var_1_6~0 (fp.neg .cse1))) (and (fp.geq ~var_1_6~0 .cse0) (fp.leq ~var_1_6~0 .cse1)))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (bvsle ((_ zero_extend 24) ~var_1_3~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 40 50) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 (fp.neg .cse0)) (fp.geq ~var_1_6~0 (fp.neg .cse1))) (and (fp.geq ~var_1_6~0 .cse0) (fp.leq ~var_1_6~0 .cse1)))) (bvsle ((_ zero_extend 24) ~var_1_3~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 14:37:08,648 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-12-16 14:37:08,649 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 39) no Hoare annotation was computed. [2023-12-16 14:37:08,649 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse1 ((_ to_fp 8 24) currentRoundingMode 9223372036854765600.0))) (or (and (fp.leq ~var_1_6~0 (fp.neg .cse0)) (fp.geq ~var_1_6~0 (fp.neg .cse1))) (and (fp.geq ~var_1_6~0 .cse0) (fp.leq ~var_1_6~0 .cse1)))) (bvsle ((_ zero_extend 24) ~var_1_3~0) (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-16 14:37:08,649 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-12-16 14:37:08,649 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-16 14:37:08,649 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-16 14:37:08,649 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-16 14:37:08,649 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-16 14:37:08,651 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 14:37:08,652 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 14:37:08,662 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-16 14:37:08,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 02:37:08 BoogieIcfgContainer [2023-12-16 14:37:08,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 14:37:08,663 INFO L158 Benchmark]: Toolchain (without parser) took 37256.27ms. Allocated memory was 182.5MB in the beginning and 283.1MB in the end (delta: 100.7MB). Free memory was 136.3MB in the beginning and 174.6MB in the end (delta: -38.2MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. [2023-12-16 14:37:08,663 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 14:37:08,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.27ms. Allocated memory is still 182.5MB. Free memory was 136.0MB in the beginning and 124.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 14:37:08,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.28ms. Allocated memory is still 182.5MB. Free memory was 124.1MB in the beginning and 122.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:37:08,664 INFO L158 Benchmark]: Boogie Preprocessor took 52.07ms. Allocated memory is still 182.5MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 14:37:08,664 INFO L158 Benchmark]: RCFGBuilder took 461.72ms. Allocated memory is still 182.5MB. Free memory was 120.3MB in the beginning and 106.3MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 14:37:08,664 INFO L158 Benchmark]: TraceAbstraction took 36464.61ms. Allocated memory was 182.5MB in the beginning and 283.1MB in the end (delta: 100.7MB). Free memory was 105.6MB in the beginning and 174.6MB in the end (delta: -69.0MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. [2023-12-16 14:37:08,665 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.27ms. Allocated memory is still 182.5MB. Free memory was 136.0MB in the beginning and 124.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.28ms. Allocated memory is still 182.5MB. Free memory was 124.1MB in the beginning and 122.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.07ms. Allocated memory is still 182.5MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 461.72ms. Allocated memory is still 182.5MB. Free memory was 120.3MB in the beginning and 106.3MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 36464.61ms. Allocated memory was 182.5MB in the beginning and 283.1MB in the end (delta: 100.7MB). Free memory was 105.6MB in the beginning and 174.6MB in the end (delta: -69.0MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated * 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.4s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 586 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 352 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 234 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 463 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, InterpolantAutomatonStates: 60, 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, 9 MinimizatonAttempts, 53 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 48 PreInvPairs, 69 NumberOfFragments, 166 HoareAnnotationTreeSize, 48 FormulaSimplifications, 3481 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FormulaSimplificationsInter, 2955 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 21.1s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 2316 SizeOfPredicates, 69 NumberOfNonLiveVariables, 843 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 887/902 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: 60]: Loop Invariant Derived loop invariant: (var_1_3 <= 0) RESULT: Ultimate proved your program to be correct! [2023-12-16 14:37:08,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...