/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-25.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 06:12:29,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 06:12:29,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 06:12:29,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 06:12:29,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 06:12:29,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 06:12:29,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 06:12:29,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 06:12:29,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 06:12:29,528 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 06:12:29,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 06:12:29,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 06:12:29,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 06:12:29,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 06:12:29,530 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 06:12:29,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 06:12:29,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 06:12:29,531 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 06:12:29,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 06:12:29,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 06:12:29,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 06:12:29,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 06:12:29,532 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 06:12:29,533 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 06:12:29,533 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 06:12:29,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 06:12:29,533 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 06:12:29,533 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 06:12:29,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 06:12:29,534 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 06:12:29,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 06:12:29,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 06:12:29,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 06:12:29,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 06:12:29,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:12:29,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 06:12:29,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 06:12:29,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 06:12:29,535 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 06:12:29,536 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 06:12:29,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 06:12:29,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 06:12:29,536 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 06:12:29,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 06:12:29,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 06:12:29,537 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 06:12:29,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 06:12:29,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 06:12:29,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 06:12:29,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 06:12:29,783 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 06:12:29,783 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 06:12:29,785 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-25.i [2023-12-24 06:12:31,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 06:12:31,261 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 06:12:31,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-25.i [2023-12-24 06:12:31,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6116923/933e533d20f4445f95629fd6b98f7c05/FLAGc6d924869 [2023-12-24 06:12:31,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa6116923/933e533d20f4445f95629fd6b98f7c05 [2023-12-24 06:12:31,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 06:12:31,289 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 06:12:31,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 06:12:31,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 06:12:31,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 06:12:31,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b215ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31, skipping insertion in model container [2023-12-24 06:12:31,297 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,319 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 06:12:31,457 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-25.i[915,928] [2023-12-24 06:12:31,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:12:31,497 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 06:12:31,506 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-25.i[915,928] [2023-12-24 06:12:31,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 06:12:31,543 INFO L206 MainTranslator]: Completed translation [2023-12-24 06:12:31,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31 WrapperNode [2023-12-24 06:12:31,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 06:12:31,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 06:12:31,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 06:12:31,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 06:12:31,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,578 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2023-12-24 06:12:31,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 06:12:31,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 06:12:31,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 06:12:31,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 06:12:31,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,606 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 06:12:31,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 06:12:31,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 06:12:31,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 06:12:31,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 06:12:31,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (1/1) ... [2023-12-24 06:12:31,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 06:12:31,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 06:12:31,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 06:12:31,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 06:12:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 06:12:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 06:12:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 06:12:31,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 06:12:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 06:12:31,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 06:12:31,764 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 06:12:31,768 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 06:12:31,898 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 06:12:31,922 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 06:12:31,922 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 06:12:31,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:12:31 BoogieIcfgContainer [2023-12-24 06:12:31,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 06:12:31,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 06:12:31,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 06:12:31,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 06:12:31,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 06:12:31" (1/3) ... [2023-12-24 06:12:31,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6a1756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:12:31, skipping insertion in model container [2023-12-24 06:12:31,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 06:12:31" (2/3) ... [2023-12-24 06:12:31,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a6a1756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 06:12:31, skipping insertion in model container [2023-12-24 06:12:31,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 06:12:31" (3/3) ... [2023-12-24 06:12:31,929 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-25.i [2023-12-24 06:12:31,941 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 06:12:31,941 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 06:12:31,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 06:12:31,977 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;@44ca6dee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 06:12:31,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 06:12:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 06:12:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-24 06:12:31,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:31,990 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:31,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:31,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1419770461, now seen corresponding path program 1 times [2023-12-24 06:12:32,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:32,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548958876] [2023-12-24 06:12:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:32,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:32,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:32,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:32,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 06:12:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:32,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 06:12:32,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-24 06:12:32,124 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:12:32,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:32,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548958876] [2023-12-24 06:12:32,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548958876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:12:32,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:12:32,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 06:12:32,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885327924] [2023-12-24 06:12:32,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:12:32,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 06:12:32,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:32,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 06:12:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 06:12:32,152 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-24 06:12:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:32,180 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2023-12-24 06:12:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 06:12:32,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2023-12-24 06:12:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:32,188 INFO L225 Difference]: With dead ends: 51 [2023-12-24 06:12:32,188 INFO L226 Difference]: Without dead ends: 25 [2023-12-24 06:12:32,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 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-24 06:12:32,195 INFO L413 NwaCegarLoop]: 31 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, 31 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-24 06:12:32,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 06:12:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-24 06:12:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-24 06:12:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 06:12:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-12-24 06:12:32,224 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 40 [2023-12-24 06:12:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:32,225 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-12-24 06:12:32,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-24 06:12:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-12-24 06:12:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-24 06:12:32,226 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:32,226 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:32,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 06:12:32,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:32,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:32,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash -770560167, now seen corresponding path program 1 times [2023-12-24 06:12:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:32,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436542347] [2023-12-24 06:12:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:32,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:32,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:32,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:32,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 06:12:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:32,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 06:12:32,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-24 06:12:38,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:12:38,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436542347] [2023-12-24 06:12:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436542347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:12:38,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:12:38,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 06:12:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045298727] [2023-12-24 06:12:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:12:38,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 06:12:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:38,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 06:12:38,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-24 06:12:38,535 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:39,000 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-24 06:12:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 06:12:39,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2023-12-24 06:12:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:39,003 INFO L225 Difference]: With dead ends: 37 [2023-12-24 06:12:39,003 INFO L226 Difference]: Without dead ends: 35 [2023-12-24 06:12:39,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-24 06:12:39,004 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:39,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 67 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 06:12:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-24 06:12:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-12-24 06:12:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-24 06:12:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-12-24 06:12:39,010 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 40 [2023-12-24 06:12:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:39,011 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-12-24 06:12:39,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-12-24 06:12:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 06:12:39,014 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:39,014 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:39,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 06:12:39,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:39,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:39,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:39,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1918328489, now seen corresponding path program 1 times [2023-12-24 06:12:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545947982] [2023-12-24 06:12:39,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:39,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:39,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:39,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:39,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 06:12:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:39,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 06:12:39,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 06:12:39,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:12:39,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545947982] [2023-12-24 06:12:39,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545947982] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:12:39,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:12:39,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 06:12:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501626041] [2023-12-24 06:12:39,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:12:39,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 06:12:39,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 06:12:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 06:12:39,312 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:39,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:39,379 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2023-12-24 06:12:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 06:12:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2023-12-24 06:12:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:39,381 INFO L225 Difference]: With dead ends: 74 [2023-12-24 06:12:39,381 INFO L226 Difference]: Without dead ends: 44 [2023-12-24 06:12:39,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-24 06:12:39,383 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:39,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 06:12:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-24 06:12:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2023-12-24 06:12:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 06:12:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2023-12-24 06:12:39,390 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 42 [2023-12-24 06:12:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:39,390 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2023-12-24 06:12:39,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2023-12-24 06:12:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 06:12:39,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:39,392 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:39,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 06:12:39,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:39,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:39,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:39,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1918388071, now seen corresponding path program 1 times [2023-12-24 06:12:39,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:39,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825645234] [2023-12-24 06:12:39,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:39,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:39,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:39,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:39,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 06:12:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:39,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 06:12:39,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 06:12:43,688 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:12:43,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825645234] [2023-12-24 06:12:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825645234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:12:43,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:12:43,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 06:12:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706643942] [2023-12-24 06:12:43,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:12:43,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 06:12:43,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:43,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 06:12:43,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 06:12:43,690 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:43,780 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2023-12-24 06:12:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 06:12:43,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2023-12-24 06:12:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:43,783 INFO L225 Difference]: With dead ends: 45 [2023-12-24 06:12:43,783 INFO L226 Difference]: Without dead ends: 43 [2023-12-24 06:12:43,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 06:12:43,784 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:43,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 97 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 06:12:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-24 06:12:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-12-24 06:12:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 06:12:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2023-12-24 06:12:43,789 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2023-12-24 06:12:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:43,789 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2023-12-24 06:12:43,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2023-12-24 06:12:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 06:12:43,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:43,790 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:43,796 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-24 06:12:43,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:43,997 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:43,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1925954985, now seen corresponding path program 1 times [2023-12-24 06:12:43,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:43,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131999931] [2023-12-24 06:12:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:43,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:43,999 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:44,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 06:12:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:44,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 06:12:44,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-24 06:12:46,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 06:12:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 06:12:49,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:49,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131999931] [2023-12-24 06:12:49,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131999931] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 06:12:49,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 06:12:49,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-12-24 06:12:49,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948918365] [2023-12-24 06:12:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:12:49,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 06:12:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 06:12:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-24 06:12:49,132 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:50,076 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-12-24 06:12:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 06:12:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2023-12-24 06:12:50,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:50,078 INFO L225 Difference]: With dead ends: 50 [2023-12-24 06:12:50,078 INFO L226 Difference]: Without dead ends: 48 [2023-12-24 06:12:50,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-24 06:12:50,079 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:50,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 06:12:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-24 06:12:50,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2023-12-24 06:12:50,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-24 06:12:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2023-12-24 06:12:50,085 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2023-12-24 06:12:50,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:50,086 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2023-12-24 06:12:50,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2023-12-24 06:12:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-24 06:12:50,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 06:12:50,087 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 06:12:50,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 06:12:50,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:50,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 06:12:50,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 06:12:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1926014567, now seen corresponding path program 1 times [2023-12-24 06:12:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 06:12:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499096230] [2023-12-24 06:12:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 06:12:50,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 06:12:50,294 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 06:12:50,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 06:12:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 06:12:50,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 06:12:50,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 06:12:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 06:12:51,855 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 06:12:51,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 06:12:51,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499096230] [2023-12-24 06:12:51,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499096230] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 06:12:51,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 06:12:51,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 06:12:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876786600] [2023-12-24 06:12:51,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 06:12:51,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 06:12:51,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 06:12:51,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 06:12:51,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 06:12:51,857 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 06:12:51,996 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-12-24 06:12:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 06:12:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2023-12-24 06:12:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 06:12:51,997 INFO L225 Difference]: With dead ends: 47 [2023-12-24 06:12:51,998 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 06:12:51,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 06:12:51,999 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 06:12:51,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 82 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 06:12:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 06:12:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 06:12:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 06:12:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 06:12:52,000 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2023-12-24 06:12:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 06:12:52,000 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 06:12:52,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-24 06:12:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 06:12:52,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 06:12:52,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 06:12:52,008 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-24 06:12:52,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 06:12:52,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 06:12:53,596 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 41) no Hoare annotation was computed. [2023-12-24 06:12:53,596 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (= currentRoundingMode roundNearestTiesToEven) [2023-12-24 06:12:53,596 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 46 57) no Hoare annotation was computed. [2023-12-24 06:12:53,596 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L895 garLoopResultBuilder]: At program point L48(line 48) 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_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.leq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L895 garLoopResultBuilder]: At program point L48-1(line 48) 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_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.leq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 06:12:53,597 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 45) no Hoare annotation was computed. [2023-12-24 06:12:53,598 INFO L895 garLoopResultBuilder]: At program point L54(line 54) 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_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.leq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:53,598 INFO L899 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2023-12-24 06:12:53,598 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 06:12:53,598 INFO L895 garLoopResultBuilder]: At program point L67-2(lines 67 73) 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_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.leq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:53,598 INFO L899 garLoopResultBuilder]: For program point L67-3(lines 67 73) no Hoare annotation was computed. [2023-12-24 06:12:53,598 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 44) no Hoare annotation was computed. [2023-12-24 06:12:53,598 INFO L895 garLoopResultBuilder]: At program point L51(line 51) 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_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.leq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:53,598 INFO L895 garLoopResultBuilder]: At program point L51-1(line 51) 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_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse0))) (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse1)))) (and (fp.geq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse0)) (fp.leq ~var_1_5~0 ((_ to_fp 11 53) currentRoundingMode .cse1))))) (= currentRoundingMode roundNearestTiesToEven)) [2023-12-24 06:12:53,598 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 06:12:53,598 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 06:12:53,598 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 06:12:53,599 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 06:12:53,601 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-24 06:12:53,602 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 06:12:53,611 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 06:12:53,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 06:12:53 BoogieIcfgContainer [2023-12-24 06:12:53,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 06:12:53,612 INFO L158 Benchmark]: Toolchain (without parser) took 22323.50ms. Allocated memory was 308.3MB in the beginning and 1.0GB in the end (delta: 703.6MB). Free memory was 253.2MB in the beginning and 833.1MB in the end (delta: -579.9MB). Peak memory consumption was 125.3MB. Max. memory is 8.0GB. [2023-12-24 06:12:53,612 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 255.9MB. Free memory is still 205.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 06:12:53,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.99ms. Allocated memory is still 308.3MB. Free memory was 252.9MB in the beginning and 241.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 06:12:53,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.31ms. Allocated memory is still 308.3MB. Free memory was 241.0MB in the beginning and 239.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:12:53,613 INFO L158 Benchmark]: Boogie Preprocessor took 44.89ms. Allocated memory is still 308.3MB. Free memory was 239.3MB in the beginning and 236.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 06:12:53,613 INFO L158 Benchmark]: RCFGBuilder took 290.08ms. Allocated memory is still 308.3MB. Free memory was 236.8MB in the beginning and 223.5MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 06:12:53,613 INFO L158 Benchmark]: TraceAbstraction took 21687.55ms. Allocated memory was 308.3MB in the beginning and 1.0GB in the end (delta: 703.6MB). Free memory was 222.9MB in the beginning and 833.1MB in the end (delta: -610.3MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2023-12-24 06:12:53,614 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.15ms. Allocated memory is still 255.9MB. Free memory is still 205.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.99ms. Allocated memory is still 308.3MB. Free memory was 252.9MB in the beginning and 241.0MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.31ms. Allocated memory is still 308.3MB. Free memory was 241.0MB in the beginning and 239.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.89ms. Allocated memory is still 308.3MB. Free memory was 239.3MB in the beginning and 236.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 290.08ms. Allocated memory is still 308.3MB. Free memory was 236.8MB in the beginning and 223.5MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21687.55ms. Allocated memory was 308.3MB in the beginning and 1.0GB in the end (delta: 703.6MB). Free memory was 222.9MB in the beginning and 833.1MB in the end (delta: -610.3MB). Peak memory consumption was 94.9MB. 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 90 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 174 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 27 PreInvPairs, 39 NumberOfFragments, 226 HoareAnnotationTreeSize, 27 FormulaSimplifications, 1318 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 1102 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.6s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 283 ConstructedInterpolants, 2 QuantifiedInterpolants, 1105 SizeOfPredicates, 40 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 417/420 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: 67]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2023-12-24 06:12:53,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...