/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-90.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-05 23:42:38,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 23:42:38,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-05 23:42:38,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 23:42:38,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 23:42:38,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 23:42:38,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 23:42:38,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 23:42:38,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 23:42:38,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 23:42:38,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 23:42:38,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 23:42:38,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 23:42:38,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 23:42:38,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 23:42:38,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 23:42:38,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 23:42:38,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-05 23:42:38,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-05 23:42:38,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 23:42:38,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 23:42:38,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 23:42:38,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 23:42:38,575 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 23:42:38,575 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 23:42:38,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 23:42:38,575 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 23:42:38,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-05 23:42:38,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 23:42:38,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 23:42:38,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 23:42:38,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 23:42:38,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 23:42:38,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 23:42:38,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:42:38,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 23:42:38,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 23:42:38,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 23:42:38,577 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 23:42:38,577 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 23:42:38,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 23:42:38,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 23:42:38,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 23:42:38,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 23:42:38,578 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-05 23:42:38,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 23:42:38,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 23:42:38,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 23:42:38,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 23:42:38,779 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 23:42:38,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2024-11-05 23:42:39,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 23:42:40,111 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 23:42:40,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2024-11-05 23:42:40,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a0a8ac1/fac7eada08484bdfa9266dd600f7d609/FLAGdab5fdac6 [2024-11-05 23:42:40,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a0a8ac1/fac7eada08484bdfa9266dd600f7d609 [2024-11-05 23:42:40,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 23:42:40,540 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 23:42:40,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 23:42:40,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 23:42:40,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 23:42:40,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3727ad7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40, skipping insertion in model container [2024-11-05 23:42:40,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 23:42:40,680 WARN L250 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_amount25_file-90.i[915,928] [2024-11-05 23:42:40,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:42:40,715 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 23:42:40,724 WARN L250 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_amount25_file-90.i[915,928] [2024-11-05 23:42:40,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 23:42:40,757 INFO L204 MainTranslator]: Completed translation [2024-11-05 23:42:40,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40 WrapperNode [2024-11-05 23:42:40,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 23:42:40,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 23:42:40,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 23:42:40,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 23:42:40,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,785 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-05 23:42:40,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 23:42:40,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 23:42:40,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 23:42:40,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 23:42:40,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,813 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]. [2024-11-05 23:42:40,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 23:42:40,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 23:42:40,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 23:42:40,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 23:42:40,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (1/1) ... [2024-11-05 23:42:40,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 23:42:40,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 23:42:40,850 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) [2024-11-05 23:42:40,852 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 [2024-11-05 23:42:40,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 23:42:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 23:42:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 23:42:40,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 23:42:40,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 23:42:40,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 23:42:40,938 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 23:42:40,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 23:42:41,112 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-05 23:42:41,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 23:42:41,128 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 23:42:41,128 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 23:42:41,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:42:41 BoogieIcfgContainer [2024-11-05 23:42:41,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 23:42:41,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 23:42:41,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 23:42:41,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 23:42:41,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 11:42:40" (1/3) ... [2024-11-05 23:42:41,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb7f99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:42:41, skipping insertion in model container [2024-11-05 23:42:41,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 11:42:40" (2/3) ... [2024-11-05 23:42:41,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb7f99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 11:42:41, skipping insertion in model container [2024-11-05 23:42:41,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 11:42:41" (3/3) ... [2024-11-05 23:42:41,135 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2024-11-05 23:42:41,147 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 23:42:41,147 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 23:42:41,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 23:42:41,189 INFO L333 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, 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;@1a77d903, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 23:42:41,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 23:42:41,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-05 23:42:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 23:42:41,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:42:41,199 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:42:41,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:42:41,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:42:41,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1387335848, now seen corresponding path program 1 times [2024-11-05 23:42:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:42:41,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921426275] [2024-11-05 23:42:41,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:42:41,211 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 [2024-11-05 23:42:41,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:42:41,212 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) [2024-11-05 23:42:41,213 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 [2024-11-05 23:42:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:42:41,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 23:42:41,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:42:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-05 23:42:41,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:42:41,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:42:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921426275] [2024-11-05 23:42:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921426275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:42:41,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:42:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-05 23:42:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86377003] [2024-11-05 23:42:41,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:42:41,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 23:42:41,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:42:41,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 23:42:41,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:42:41,402 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 23:42:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:42:41,419 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-05 23:42:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 23:42:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-11-05 23:42:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:42:41,425 INFO L225 Difference]: With dead ends: 95 [2024-11-05 23:42:41,425 INFO L226 Difference]: Without dead ends: 47 [2024-11-05 23:42:41,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 23:42:41,430 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 23:42:41,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 23:42:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-05 23:42:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-05 23:42:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-05 23:42:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-05 23:42:41,464 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 107 [2024-11-05 23:42:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:42:41,464 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-05 23:42:41,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 23:42:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-05 23:42:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 23:42:41,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:42:41,466 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:42:41,471 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 [2024-11-05 23:42:41,667 WARN L453 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 [2024-11-05 23:42:41,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:42:41,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:42:41,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2101967718, now seen corresponding path program 1 times [2024-11-05 23:42:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:42:41,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289146589] [2024-11-05 23:42:41,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:42:41,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:42:41,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:42:41,672 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) [2024-11-05 23:42:41,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 23:42:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:42:41,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-05 23:42:41,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:42:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 23:42:44,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-05 23:42:44,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:42:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289146589] [2024-11-05 23:42:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289146589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-05 23:42:44,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-05 23:42:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-05 23:42:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957028808] [2024-11-05 23:42:44,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:42:44,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 23:42:44,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:42:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 23:42:44,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-05 23:42:44,440 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 23:42:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:42:45,786 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2024-11-05 23:42:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-05 23:42:45,786 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-05 23:42:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:42:45,789 INFO L225 Difference]: With dead ends: 128 [2024-11-05 23:42:45,789 INFO L226 Difference]: Without dead ends: 126 [2024-11-05 23:42:45,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2024-11-05 23:42:45,791 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 180 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 23:42:45,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 389 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-05 23:42:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-05 23:42:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2024-11-05 23:42:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-05 23:42:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-05 23:42:45,817 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 107 [2024-11-05 23:42:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:42:45,818 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-05 23:42:45,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 23:42:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-05 23:42:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-05 23:42:45,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:42:45,821 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:42:45,827 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 [2024-11-05 23:42:46,021 WARN L453 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 [2024-11-05 23:42:46,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:42:46,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:42:46,024 INFO L85 PathProgramCache]: Analyzing trace with hash -417992216, now seen corresponding path program 1 times [2024-11-05 23:42:46,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:42:46,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064566774] [2024-11-05 23:42:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:42:46,025 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 [2024-11-05 23:42:46,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:42:46,027 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) [2024-11-05 23:42:46,028 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 [2024-11-05 23:42:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:42:46,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 23:42:46,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:42:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-05 23:42:46,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:42:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 23:42:46,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:42:46,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064566774] [2024-11-05 23:42:46,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064566774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 23:42:46,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 23:42:46,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-05 23:42:46,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18107175] [2024-11-05 23:42:46,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 23:42:46,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 23:42:46,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:42:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 23:42:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-05 23:42:46,297 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-05 23:42:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:42:46,647 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2024-11-05 23:42:46,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 23:42:46,648 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 107 [2024-11-05 23:42:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:42:46,650 INFO L225 Difference]: With dead ends: 150 [2024-11-05 23:42:46,650 INFO L226 Difference]: Without dead ends: 106 [2024-11-05 23:42:46,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2024-11-05 23:42:46,651 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 23:42:46,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 224 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 23:42:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-05 23:42:46,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-05 23:42:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-05 23:42:46,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2024-11-05 23:42:46,673 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 107 [2024-11-05 23:42:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:42:46,673 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2024-11-05 23:42:46,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-05 23:42:46,673 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2024-11-05 23:42:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-05 23:42:46,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:42:46,674 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:42:46,680 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 [2024-11-05 23:42:46,875 WARN L453 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 [2024-11-05 23:42:46,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:42:46,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:42:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash 331001653, now seen corresponding path program 1 times [2024-11-05 23:42:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:42:46,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172227153] [2024-11-05 23:42:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:42:46,877 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 [2024-11-05 23:42:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:42:46,879 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) [2024-11-05 23:42:46,880 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 [2024-11-05 23:42:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:42:46,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-05 23:42:46,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:42:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-05 23:42:49,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:42:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 23:42:57,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:42:57,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172227153] [2024-11-05 23:42:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172227153] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 23:42:57,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 23:42:57,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2024-11-05 23:42:57,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911624938] [2024-11-05 23:42:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:42:57,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-05 23:42:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:42:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-05 23:42:57,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-05 23:42:57,027 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 23:42:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:42:58,681 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2024-11-05 23:42:58,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 23:42:58,681 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-05 23:42:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:42:58,683 INFO L225 Difference]: With dead ends: 117 [2024-11-05 23:42:58,683 INFO L226 Difference]: Without dead ends: 115 [2024-11-05 23:42:58,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2024-11-05 23:42:58,684 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-05 23:42:58,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 357 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-05 23:42:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-05 23:42:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2024-11-05 23:42:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-05 23:42:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2024-11-05 23:42:58,701 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 108 [2024-11-05 23:42:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:42:58,702 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2024-11-05 23:42:58,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 23:42:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2024-11-05 23:42:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-05 23:42:58,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:42:58,706 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:42:58,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 23:42:58,906 WARN L453 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 [2024-11-05 23:42:58,906 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:42:58,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:42:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1432785787, now seen corresponding path program 1 times [2024-11-05 23:42:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:42:58,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879726759] [2024-11-05 23:42:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:42:58,907 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 [2024-11-05 23:42:58,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:42:58,909 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) [2024-11-05 23:42:58,910 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 [2024-11-05 23:42:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:42:58,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-05 23:42:58,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:43:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-05 23:43:02,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:43:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 23:43:09,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:43:09,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879726759] [2024-11-05 23:43:09,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879726759] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 23:43:09,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 23:43:09,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [35] total 48 [2024-11-05 23:43:09,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937448416] [2024-11-05 23:43:09,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:43:09,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 23:43:09,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:43:09,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 23:43:09,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1895, Unknown=0, NotChecked=0, Total=2256 [2024-11-05 23:43:09,560 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 23:43:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:43:12,440 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2024-11-05 23:43:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 23:43:12,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-05 23:43:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:43:12,442 INFO L225 Difference]: With dead ends: 131 [2024-11-05 23:43:12,442 INFO L226 Difference]: Without dead ends: 129 [2024-11-05 23:43:12,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=446, Invalid=2416, Unknown=0, NotChecked=0, Total=2862 [2024-11-05 23:43:12,444 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-05 23:43:12,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 172 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-05 23:43:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-05 23:43:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2024-11-05 23:43:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-05 23:43:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2024-11-05 23:43:12,466 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 109 [2024-11-05 23:43:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:43:12,466 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2024-11-05 23:43:12,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 23:43:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2024-11-05 23:43:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-05 23:43:12,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 23:43:12,467 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 23:43:12,473 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 [2024-11-05 23:43:12,668 WARN L453 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 [2024-11-05 23:43:12,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 23:43:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 23:43:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1434632829, now seen corresponding path program 1 times [2024-11-05 23:43:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-05 23:43:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029277784] [2024-11-05 23:43:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 23:43:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 23:43:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 23:43:12,671 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) [2024-11-05 23:43:12,672 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 [2024-11-05 23:43:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 23:43:12,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-05 23:43:12,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 23:43:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-05 23:43:15,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 23:43:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-05 23:43:25,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-05 23:43:25,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029277784] [2024-11-05 23:43:25,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029277784] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 23:43:25,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 23:43:25,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2024-11-05 23:43:25,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111431615] [2024-11-05 23:43:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 23:43:25,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-05 23:43:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-05 23:43:25,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-05 23:43:25,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2024-11-05 23:43:25,532 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 23:43:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 23:43:27,747 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2024-11-05 23:43:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 23:43:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-05 23:43:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 23:43:27,748 INFO L225 Difference]: With dead ends: 124 [2024-11-05 23:43:27,748 INFO L226 Difference]: Without dead ends: 0 [2024-11-05 23:43:27,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2024-11-05 23:43:27,750 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 136 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-05 23:43:27,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 312 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-05 23:43:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-05 23:43:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-05 23:43:27,751 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) [2024-11-05 23:43:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-05 23:43:27,751 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2024-11-05 23:43:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 23:43:27,751 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-05 23:43:27,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-05 23:43:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-05 23:43:27,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-05 23:43:27,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-05 23:43:27,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-05 23:43:27,954 WARN L453 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 [2024-11-05 23:43:27,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-05 23:43:27,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-05 23:43:45,730 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-05 23:43:45,741 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-05 23:43:45,742 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~stepLocal_1~0 [2024-11-05 23:43:45,742 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-05 23:43:45,743 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-05 23:43:45,744 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:43:45,744 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:43:45,744 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:43:45,745 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:43:45,745 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-05 23:43:45,745 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-05 23:43:45,745 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-05 23:43:45,745 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-05 23:43:45,745 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-05 23:43:45,746 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-05 23:43:45,746 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-05 23:43:45,746 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-05 23:43:45,751 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-05 23:43:45,752 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-05 23:43:45,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.11 11:43:45 BoogieIcfgContainer [2024-11-05 23:43:45,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-05 23:43:45,755 INFO L158 Benchmark]: Toolchain (without parser) took 65214.91ms. Allocated memory was 219.2MB in the beginning and 759.2MB in the end (delta: 540.0MB). Free memory was 182.8MB in the beginning and 343.0MB in the end (delta: -160.3MB). Peak memory consumption was 450.5MB. Max. memory is 8.0GB. [2024-11-05 23:43:45,755 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 219.2MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-05 23:43:45,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.94ms. Allocated memory is still 219.2MB. Free memory was 182.8MB in the beginning and 168.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-11-05 23:43:45,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.77ms. Allocated memory is still 219.2MB. Free memory was 168.1MB in the beginning and 166.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-05 23:43:45,755 INFO L158 Benchmark]: Boogie Preprocessor took 39.49ms. Allocated memory is still 219.2MB. Free memory was 166.0MB in the beginning and 163.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-05 23:43:45,755 INFO L158 Benchmark]: RCFGBuilder took 302.54ms. Allocated memory is still 219.2MB. Free memory was 163.3MB in the beginning and 147.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-05 23:43:45,756 INFO L158 Benchmark]: TraceAbstraction took 64624.10ms. Allocated memory was 219.2MB in the beginning and 759.2MB in the end (delta: 540.0MB). Free memory was 147.1MB in the beginning and 343.0MB in the end (delta: -195.9MB). Peak memory consumption was 414.8MB. Max. memory is 8.0GB. [2024-11-05 23:43:45,756 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 219.2MB. Free memory is still 176.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.94ms. Allocated memory is still 219.2MB. Free memory was 182.8MB in the beginning and 168.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.77ms. Allocated memory is still 219.2MB. Free memory was 168.1MB in the beginning and 166.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.49ms. Allocated memory is still 219.2MB. Free memory was 166.0MB in the beginning and 163.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 302.54ms. Allocated memory is still 219.2MB. Free memory was 163.3MB in the beginning and 147.6MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 64624.10ms. Allocated memory was 219.2MB in the beginning and 759.2MB in the end (delta: 540.0MB). Free memory was 147.1MB in the beginning and 343.0MB in the end (delta: -195.9MB). Peak memory consumption was 414.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~stepLocal_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.8s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 663 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 1522 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1115 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 407 mSDtfsCounter, 1560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1113 GetRequests, 953 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=5, InterpolantAutomatonStates: 73, 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, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1070 ConstructedInterpolants, 17 QuantifiedInterpolants, 12293 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1066 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 5302/5440 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: 103]: Loop Invariant Derived loop invariant: (((((var_1_15 <= 1) && (2 == last_1_var_1_6)) && (var_1_6 == 2)) && (var_1_15 >= 1)) || ((((((2 * var_1_11) < var_1_11) || (var_1_16 == var_1_15)) && (var_1_16 <= 1)) && (var_1_15 >= 1)) && (!((2 * var_1_11) < var_1_11) || (var_1_16 == var_1_15)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((var_1_15 <= 1) && (var_1_15 >= 1)) || ((((var_1_15 <= 1) && (var_1_16 >= 1)) && (var_1_16 <= 1)) && (var_1_15 >= 1))) Ensures: (((((var_1_15 <= 1) && (var_1_15 >= 1)) || ((((var_1_15 <= 1) && (var_1_16 >= 1)) && (var_1_16 <= 1)) && (var_1_15 >= 1))) && (0 != cond)) && ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_6 == \old(last_1_var_1_6)))) RESULT: Ultimate proved your program to be correct! [2024-11-05 23:43:45,841 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...