./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/interpolation.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:36:07,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:36:07,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:36:07,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:36:07,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:36:07,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:36:07,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:36:07,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:36:07,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:36:07,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:36:07,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:36:07,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:36:07,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:36:07,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:36:07,312 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:36:07,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:36:07,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:36:07,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:36:07,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:36:07,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:36:07,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:36:07,313 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:36:07,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:36:07,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:36:07,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:36:07,314 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:36:07,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:36:07,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:36:07,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:36:07,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:36:07,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:36:07,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:36:07,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:36:07,315 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2025-03-03 11:36:07,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:36:07,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:36:07,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:36:07,545 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:36:07,546 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:36:07,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c [2025-03-03 11:36:08,727 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13da32c7/ad7d3e4f5a284dadba882e4b86c17acf/FLAGa1fa7ff82 [2025-03-03 11:36:08,966 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:36:08,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c [2025-03-03 11:36:08,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13da32c7/ad7d3e4f5a284dadba882e4b86c17acf/FLAGa1fa7ff82 [2025-03-03 11:36:09,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13da32c7/ad7d3e4f5a284dadba882e4b86c17acf [2025-03-03 11:36:09,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:36:09,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:36:09,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:36:09,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:36:09,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:36:09,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b739f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09, skipping insertion in model container [2025-03-03 11:36:09,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:36:09,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2025-03-03 11:36:09,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:36:09,451 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:36:09,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2025-03-03 11:36:09,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:36:09,481 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:36:09,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09 WrapperNode [2025-03-03 11:36:09,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:36:09,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:36:09,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:36:09,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:36:09,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,503 INFO L138 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-03 11:36:09,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:36:09,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:36:09,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:36:09,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:36:09,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,517 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-03-03 11:36:09,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:36:09,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:36:09,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:36:09,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:36:09,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (1/1) ... [2025-03-03 11:36:09,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:36:09,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:36:09,552 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) [2025-03-03 11:36:09,554 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 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:36:09,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-03 11:36:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 11:36:09,616 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:36:09,618 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:36:09,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#min~0#1.base, main_~#min~0#1.offset);havoc main_~#min~0#1.base, main_~#min~0#1.offset;call ULTIMATE.dealloc(main_~#max~0#1.base, main_~#max~0#1.offset);havoc main_~#max~0#1.base, main_~#max~0#1.offset; [2025-03-03 11:36:09,738 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 11:36:09,738 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:36:09,746 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:36:09,746 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:36:09,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:36:09 BoogieIcfgContainer [2025-03-03 11:36:09,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:36:09,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:36:09,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:36:09,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:36:09,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:36:09" (1/3) ... [2025-03-03 11:36:09,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4bdc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:36:09, skipping insertion in model container [2025-03-03 11:36:09,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:09" (2/3) ... [2025-03-03 11:36:09,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4bdc62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:36:09, skipping insertion in model container [2025-03-03 11:36:09,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:36:09" (3/3) ... [2025-03-03 11:36:09,758 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation.c [2025-03-03 11:36:09,769 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:36:09,770 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:36:09,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:36:09,817 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;@6b1178f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:36:09,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:36:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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) [2025-03-03 11:36:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 11:36:09,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:09,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:09,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:09,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1844976823, now seen corresponding path program 1 times [2025-03-03 11:36:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:36:09,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177208260] [2025-03-03 11:36:09,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:36:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 11:36:09,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 11:36:09,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:09,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:36:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:36:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177208260] [2025-03-03 11:36:09,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177208260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:36:09,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:36:09,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:36:09,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648391332] [2025-03-03 11:36:09,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:36:09,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 11:36:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:36:09,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 11:36:09,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 11:36:09,965 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2025-03-03 11:36:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:36:09,972 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-03-03 11:36:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 11:36:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 11:36:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:36:09,978 INFO L225 Difference]: With dead ends: 27 [2025-03-03 11:36:09,978 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 11:36:09,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 11:36:09,982 INFO L435 NwaCegarLoop]: 18 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, 18 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 [2025-03-03 11:36:09,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:36:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 11:36:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 11:36:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2025-03-03 11:36:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-03 11:36:10,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2025-03-03 11:36:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:36:10,001 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-03 11:36:10,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2025-03-03 11:36:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-03 11:36:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 11:36:10,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:10,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:10,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:36:10,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:10,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1873605974, now seen corresponding path program 1 times [2025-03-03 11:36:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:36:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578528636] [2025-03-03 11:36:10,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:10,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:36:10,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 11:36:10,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 11:36:10,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:10,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:36:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:36:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578528636] [2025-03-03 11:36:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578528636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:36:10,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:36:10,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:36:10,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663743613] [2025-03-03 11:36:10,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:36:10,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:36:10,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:36:10,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:36:10,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:36:10,100 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-03-03 11:36:10,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:36:10,118 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-03-03 11:36:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:36:10,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 11:36:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:36:10,120 INFO L225 Difference]: With dead ends: 22 [2025-03-03 11:36:10,120 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 11:36:10,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:36:10,121 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:36:10,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:36:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 11:36:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2025-03-03 11:36:10,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) [2025-03-03 11:36:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-03 11:36:10,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2025-03-03 11:36:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:36:10,125 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-03 11:36:10,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-03-03 11:36:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-03 11:36:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 11:36:10,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:10,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:10,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 11:36:10,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:10,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:10,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2048618930, now seen corresponding path program 1 times [2025-03-03 11:36:10,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:36:10,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426391013] [2025-03-03 11:36:10,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:10,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:36:10,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 11:36:10,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 11:36:10,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:10,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:36:10,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 11:36:10,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 11:36:10,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 11:36:10,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:36:10,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 11:36:10,178 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 11:36:10,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 11:36:10,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 11:36:10,182 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 11:36:10,196 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:36:10,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:36:10 BoogieIcfgContainer [2025-03-03 11:36:10,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:36:10,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:36:10,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:36:10,199 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:36:10,200 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:36:09" (3/4) ... [2025-03-03 11:36:10,201 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 11:36:10,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:36:10,202 INFO L158 Benchmark]: Toolchain (without parser) took 896.61ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 58.3MB in the end (delta: 55.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 11:36:10,203 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:36:10,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.87ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 102.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:36:10,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.08ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:36:10,204 INFO L158 Benchmark]: Boogie Preprocessor took 22.12ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:36:10,204 INFO L158 Benchmark]: IcfgBuilder took 220.71ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 87.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:36:10,204 INFO L158 Benchmark]: TraceAbstraction took 448.26ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 58.8MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 11:36:10,204 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 58.3MB in the end (delta: 571.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:36:10,208 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.33ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.87ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 102.5MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.08ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.12ms. Allocated memory is still 142.6MB. Free memory was 101.1MB in the beginning and 99.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 220.71ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 87.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 448.26ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 58.8MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 58.3MB in the end (delta: 571.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 9]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 26, overapproximation of someBinaryFLOATComparisonOperation at line 19, overapproximation of someBinaryFLOATComparisonOperation at line 22, overapproximation of someBinaryFLOATComparisonOperation at line 19, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 24. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L18] t = __VERIFIER_nondet_float() [L19] EXPR min[0] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={4:0}] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L19] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={4:0}] [L19] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) [L19] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L21] i = 0 VAL [i=0, max={4:0}] [L21] COND TRUE i < sizeof(min) / sizeof(min[0]) [L22] EXPR max[i] [L22] COND TRUE t <= max[i] [L24] EXPR min[i] [L24] EXPR max[i] [L24] EXPR min[i] [L24] z = (t - min[i]) / (max[i] - min[i]) [L26] CALL __VERIFIER_assert(z >= 0.f && z <= 1.f) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 11:36:10,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/interpolation.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:36:12,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:36:12,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 11:36:12,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:36:12,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:36:12,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:36:12,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:36:12,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:36:12,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:36:12,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:36:12,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:36:12,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:36:12,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:36:12,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:36:12,148 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:36:12,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:36:12,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:36:12,148 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:36:12,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:36:12,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:36:12,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:36:12,149 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:36:12,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:36:12,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:36:12,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:36:12,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:36:12,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:36:12,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:36:12,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:36:12,150 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:36:12,150 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:36:12,150 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 11:36:12,151 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 11:36:12,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:36:12,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:36:12,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:36:12,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:36:12,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30f6a485d859f7eee00a1696279d966456b3a38851c6233a0367f621da73d6bd [2025-03-03 11:36:12,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:36:12,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:36:12,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:36:12,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:36:12,394 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:36:12,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c [2025-03-03 11:36:13,519 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8fcfaeee/c22cc88b94ad4cd3bff707a6ece581f8/FLAGcf0fbcd2e [2025-03-03 11:36:13,692 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:36:13,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c [2025-03-03 11:36:13,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8fcfaeee/c22cc88b94ad4cd3bff707a6ece581f8/FLAGcf0fbcd2e [2025-03-03 11:36:14,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8fcfaeee/c22cc88b94ad4cd3bff707a6ece581f8 [2025-03-03 11:36:14,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:36:14,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:36:14,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:36:14,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:36:14,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:36:14,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8568b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14, skipping insertion in model container [2025-03-03 11:36:14,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:36:14,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2025-03-03 11:36:14,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:36:14,216 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:36:14,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c[449,462] [2025-03-03 11:36:14,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:36:14,242 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:36:14,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14 WrapperNode [2025-03-03 11:36:14,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:36:14,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:36:14,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:36:14,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:36:14,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,267 INFO L138 Inliner]: procedures = 19, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2025-03-03 11:36:14,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:36:14,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:36:14,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:36:14,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:36:14,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,284 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-03-03 11:36:14,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,291 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:36:14,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:36:14,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:36:14,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:36:14,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (1/1) ... [2025-03-03 11:36:14,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:36:14,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:36:14,331 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) [2025-03-03 11:36:14,333 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 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:36:14,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:36:14,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 11:36:14,406 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:36:14,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:36:16,189 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: call ULTIMATE.dealloc(main_~#min~0#1.base, main_~#min~0#1.offset);havoc main_~#min~0#1.base, main_~#min~0#1.offset;call ULTIMATE.dealloc(main_~#max~0#1.base, main_~#max~0#1.offset);havoc main_~#max~0#1.base, main_~#max~0#1.offset; [2025-03-03 11:36:16,197 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 11:36:16,197 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:36:16,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:36:16,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:36:16,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:36:16 BoogieIcfgContainer [2025-03-03 11:36:16,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:36:16,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:36:16,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:36:16,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:36:16,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:36:14" (1/3) ... [2025-03-03 11:36:16,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cbbc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:36:16, skipping insertion in model container [2025-03-03 11:36:16,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:36:14" (2/3) ... [2025-03-03 11:36:16,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cbbc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:36:16, skipping insertion in model container [2025-03-03 11:36:16,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:36:16" (3/3) ... [2025-03-03 11:36:16,209 INFO L128 eAbstractionObserver]: Analyzing ICFG interpolation.c [2025-03-03 11:36:16,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:36:16,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interpolation.c that has 1 procedures, 16 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:36:16,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:36:16,263 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;@4282e48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:36:16,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:36:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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) [2025-03-03 11:36:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 11:36:16,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:16,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:16,271 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:16,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:16,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1844976823, now seen corresponding path program 1 times [2025-03-03 11:36:16,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:36:16,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826773000] [2025-03-03 11:36:16,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:16,281 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 [2025-03-03 11:36:16,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:36:16,283 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) [2025-03-03 11:36:16,284 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 [2025-03-03 11:36:16,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 11:36:16,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 11:36:16,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:16,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:36:16,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 11:36:16,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:36:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:16,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:36:16,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:36:16,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826773000] [2025-03-03 11:36:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826773000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:36:16,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:36:16,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:36:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265305743] [2025-03-03 11:36:16,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:36:16,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 11:36:16,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:36:16,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 11:36:16,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 11:36:16,579 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2025-03-03 11:36:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:36:16,585 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2025-03-03 11:36:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 11:36:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 11:36:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:36:16,590 INFO L225 Difference]: With dead ends: 27 [2025-03-03 11:36:16,590 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 11:36:16,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 11:36:16,593 INFO L435 NwaCegarLoop]: 18 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, 18 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 [2025-03-03 11:36:16,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:36:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 11:36:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 11:36:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2025-03-03 11:36:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-03 11:36:16,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2025-03-03 11:36:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:36:16,616 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-03 11:36:16,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2025-03-03 11:36:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-03 11:36:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 11:36:16,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:16,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:16,626 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 [2025-03-03 11:36:16,817 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 [2025-03-03 11:36:16,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:16,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:16,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1873605974, now seen corresponding path program 1 times [2025-03-03 11:36:16,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:36:16,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732984997] [2025-03-03 11:36:16,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:16,819 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 [2025-03-03 11:36:16,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:36:16,820 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) [2025-03-03 11:36:16,821 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 [2025-03-03 11:36:16,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 11:36:17,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 11:36:17,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:17,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:36:17,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:36:17,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:36:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:17,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:36:17,073 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:36:17,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732984997] [2025-03-03 11:36:17,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732984997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:36:17,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:36:17,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:36:17,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631666954] [2025-03-03 11:36:17,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:36:17,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:36:17,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:36:17,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:36:17,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:36:17,075 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-03-03 11:36:19,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 11:36:21,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 11:36:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:36:21,479 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2025-03-03 11:36:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:36:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 11:36:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:36:21,480 INFO L225 Difference]: With dead ends: 19 [2025-03-03 11:36:21,480 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 11:36:21,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:36:21,480 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 11:36:21,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 11:36:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 11:36:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2025-03-03 11:36:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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) [2025-03-03 11:36:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2025-03-03 11:36:21,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2025-03-03 11:36:21,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:36:21,483 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2025-03-03 11:36:21,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2025-03-03 11:36:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2025-03-03 11:36:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 11:36:21,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:21,484 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:21,493 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 [2025-03-03 11:36:21,684 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 [2025-03-03 11:36:21,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:21,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2048618930, now seen corresponding path program 1 times [2025-03-03 11:36:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:36:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081932671] [2025-03-03 11:36:21,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:21,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:36:21,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:36:21,687 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) [2025-03-03 11:36:21,688 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 [2025-03-03 11:36:21,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 11:36:21,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 11:36:21,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:21,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:36:21,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 11:36:21,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:36:23,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 11:36:23,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 348 treesize of output 264 [2025-03-03 11:36:23,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 157 [2025-03-03 11:36:37,624 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 11:36:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:41,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:36:41,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:36:41,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081932671] [2025-03-03 11:36:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081932671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:36:41,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:36:41,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 11:36:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268051830] [2025-03-03 11:36:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:36:41,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 11:36:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:36:41,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 11:36:41,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 11:36:41,765 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 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) [2025-03-03 11:36:43,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 11:36:47,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 11:36:50,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 11:36:50,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:36:50,889 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2025-03-03 11:36:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 11:36:50,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 11:36:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:36:50,890 INFO L225 Difference]: With dead ends: 25 [2025-03-03 11:36:50,890 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 11:36:50,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 11:36:50,890 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:36:50,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 25 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 9.0s Time] [2025-03-03 11:36:50,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 11:36:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-03-03 11:36:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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) [2025-03-03 11:36:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-03 11:36:50,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2025-03-03 11:36:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:36:50,898 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-03 11:36:50,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0) internal successors, (11), 10 states have internal predecessors, (11), 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) [2025-03-03 11:36:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-03 11:36:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 11:36:50,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:50,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:50,908 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 [2025-03-03 11:36:51,099 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 [2025-03-03 11:36:51,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:51,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash 438893903, now seen corresponding path program 1 times [2025-03-03 11:36:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:36:51,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905691699] [2025-03-03 11:36:51,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:51,101 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 [2025-03-03 11:36:51,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:36:51,102 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) [2025-03-03 11:36:51,103 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 [2025-03-03 11:36:51,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 11:36:51,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 11:36:51,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:51,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:36:51,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 11:36:51,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:36:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:51,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:36:51,343 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:36:51,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905691699] [2025-03-03 11:36:51,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905691699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:36:51,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:36:51,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:36:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237580799] [2025-03-03 11:36:51,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:36:51,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:36:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:36:51,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:36:51,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:36:51,344 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-03 11:36:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:36:51,374 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-03 11:36:51,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:36:51,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 11:36:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:36:51,375 INFO L225 Difference]: With dead ends: 24 [2025-03-03 11:36:51,375 INFO L226 Difference]: Without dead ends: 14 [2025-03-03 11:36:51,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:36:51,376 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:36:51,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:36:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-03 11:36:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-03 11:36:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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) [2025-03-03 11:36:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-03-03 11:36:51,378 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2025-03-03 11:36:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:36:51,378 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-03-03 11:36:51,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-03-03 11:36:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-03-03 11:36:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 11:36:51,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:51,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:51,390 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 [2025-03-03 11:36:51,584 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 [2025-03-03 11:36:51,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:51,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash 919350357, now seen corresponding path program 1 times [2025-03-03 11:36:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:36:51,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966884971] [2025-03-03 11:36:51,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:51,585 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 [2025-03-03 11:36:51,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:36:51,587 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) [2025-03-03 11:36:51,588 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 [2025-03-03 11:36:51,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 11:36:51,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 11:36:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:36:51,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:36:51,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:36:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:51,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:36:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:36:51,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:36:51,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966884971] [2025-03-03 11:36:51,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966884971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:36:51,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:36:51,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-03 11:36:51,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907564396] [2025-03-03 11:36:51,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 11:36:51,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 11:36:51,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:36:51,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 11:36:51,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:36:51,876 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2025-03-03 11:36:55,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-03 11:36:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:36:56,677 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2025-03-03 11:36:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 11:36:56,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 11:36:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:36:56,679 INFO L225 Difference]: With dead ends: 26 [2025-03-03 11:36:56,679 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 11:36:56,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:36:56,680 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-03 11:36:56,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-03-03 11:36:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 11:36:56,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-03-03 11:36:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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) [2025-03-03 11:36:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2025-03-03 11:36:56,682 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2025-03-03 11:36:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:36:56,682 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2025-03-03 11:36:56,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2025-03-03 11:36:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2025-03-03 11:36:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 11:36:56,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:36:56,683 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:36:56,691 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 (6)] Ended with exit code 0 [2025-03-03 11:36:56,883 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 [2025-03-03 11:36:56,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:36:56,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:36:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1565771985, now seen corresponding path program 1 times [2025-03-03 11:36:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:36:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819143131] [2025-03-03 11:36:56,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:36:56,884 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 [2025-03-03 11:36:56,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:36:56,886 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) [2025-03-03 11:36:56,887 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 [2025-03-03 11:36:56,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 11:36:57,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 11:36:57,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:36:57,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:36:57,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 11:36:57,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:36:59,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 11:36:59,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 393 treesize of output 285 [2025-03-03 11:36:59,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 11:36:59,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 159 [2025-03-03 11:37:07,239 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 11:37:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:37:11,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:37:17,981 WARN L286 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 11:37:26,065 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 11:37:30,090 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from false [2025-03-03 11:37:34,116 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1) (fp.sub c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) .cse1)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0)))) is different from true [2025-03-03 11:37:44,669 WARN L286 SmtUtils]: Spent 6.99s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 11:37:52,436 WARN L286 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)