./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.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-newlib/double_req_bl_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:55:05,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:55:05,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:55:05,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:55:05,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:55:05,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:55:05,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:55:05,803 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:55:05,803 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:55:05,803 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:55:05,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:55:05,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:55:05,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:55:05,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:55:05,804 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:55:05,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:55:05,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:55:05,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:55:05,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:55:05,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:55:05,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:55:05,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:55:05,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:55:05,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:55:05,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:55:05,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:55:05,807 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2025-03-03 11:55:06,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:55:06,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:55:06,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:55:06,040 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:55:06,040 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:55:06,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2025-03-03 11:55:07,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7319f54f6/48cf4c206d084217873a17bd198b7551/FLAGcf576647d [2025-03-03 11:55:07,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:55:07,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2025-03-03 11:55:07,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7319f54f6/48cf4c206d084217873a17bd198b7551/FLAGcf576647d [2025-03-03 11:55:07,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7319f54f6/48cf4c206d084217873a17bd198b7551 [2025-03-03 11:55:07,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:55:07,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:55:07,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:55:07,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:55:07,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:55:07,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07, skipping insertion in model container [2025-03-03 11:55:07,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:55:07,537 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-newlib/double_req_bl_1231b.c[1765,1778] [2025-03-03 11:55:07,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:55:07,549 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:55:07,566 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-newlib/double_req_bl_1231b.c[1765,1778] [2025-03-03 11:55:07,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:55:07,585 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:55:07,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07 WrapperNode [2025-03-03 11:55:07,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:55:07,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:55:07,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:55:07,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:55:07,592 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:55:07" (1/1) ... [2025-03-03 11:55:07,602 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:55:07" (1/1) ... [2025-03-03 11:55:07,615 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2025-03-03 11:55:07,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:55:07,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:55:07,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:55:07,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:55:07,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,636 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-03 11:55:07,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,644 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:55:07,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:55:07,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:55:07,651 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:55:07,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (1/1) ... [2025-03-03 11:55:07,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:55:07,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:55:07,675 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:55:07,679 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:55:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-03 11:55:07,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:55:07,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 11:55:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 11:55:07,740 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:55:07,742 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:55:07,889 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 11:55:07,890 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:55:07,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:55:07,897 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:55:07,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:07 BoogieIcfgContainer [2025-03-03 11:55:07,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:55:07,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:55:07,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:55:07,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:55:07,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:55:07" (1/3) ... [2025-03-03 11:55:07,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465c3985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:07, skipping insertion in model container [2025-03-03 11:55:07,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:07" (2/3) ... [2025-03-03 11:55:07,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465c3985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:07, skipping insertion in model container [2025-03-03 11:55:07,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:07" (3/3) ... [2025-03-03 11:55:07,906 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2025-03-03 11:55:07,919 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:55:07,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1231b.c that has 2 procedures, 28 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-03 11:55:07,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:55:07,968 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;@5288b38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:55:07,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 11:55:07,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 24 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 11:55:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 11:55:07,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:07,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:07,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [__fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:07,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:07,980 INFO L85 PathProgramCache]: Analyzing trace with hash 30512721, now seen corresponding path program 1 times [2025-03-03 11:55:07,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:55:07,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862404813] [2025-03-03 11:55:07,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:07,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:55:08,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 11:55:08,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 11:55:08,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:08,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:55:08,049 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 11:55:08,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 11:55:08,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 11:55:08,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:55:08,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 11:55:08,073 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 11:55:08,074 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __fpclassify_doubleErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (1 of 2 remaining) [2025-03-03 11:55:08,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-03 11:55:08,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:55:08,078 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-03 11:55:08,089 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:55:08,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:55:08 BoogieIcfgContainer [2025-03-03 11:55:08,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:55:08,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:55:08,092 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:55:08,092 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:55:08,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:07" (3/4) ... [2025-03-03 11:55:08,094 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 11:55:08,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:55:08,095 INFO L158 Benchmark]: Toolchain (without parser) took 701.29ms. Allocated memory is still 167.8MB. Free memory was 125.3MB in the beginning and 83.8MB in the end (delta: 41.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 11:55:08,095 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:08,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.88ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 113.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:08,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.27ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 111.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:08,096 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 111.0MB in the end (delta: 916.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:08,096 INFO L158 Benchmark]: IcfgBuilder took 247.19ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 97.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 11:55:08,096 INFO L158 Benchmark]: TraceAbstraction took 192.83ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 83.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 11:55:08,097 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:08,098 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.19ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.88ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 113.2MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.27ms. Allocated memory is still 167.8MB. Free memory was 113.2MB in the beginning and 111.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 111.0MB in the end (delta: 916.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 247.19ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 97.4MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 192.83ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 83.8MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 167.8MB. Free memory is still 83.8MB. There was no memory consumed. 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: 23]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of union with floats in the HoenickeLindenmann_Original memory model at line 23, overapproximation of someBinaryDOUBLEComparisonOperation at line 18. Possible FailurePath: [L62] double x = __VERIFIER_nondet_double(); [L63] double y = 0.0 / 0.0; [L64] CALL, EXPR isnan_double(x) [L18] return x != x; VAL [\result=0] [L64] RET, EXPR isnan_double(x) [L64] COND TRUE !isnan_double(x) [L66] CALL fmin_double(x, y) [L47] CALL __fpclassify_double(x) VAL [\old(x)=54] [L20] __uint32_t msw, lsw; VAL [\old(x)=54] [L23] ieee_double_shape_type ew_u; VAL [\old(x)=54] - UnprovableResult [Line: 70]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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:55:08,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- 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-newlib/double_req_bl_1231b.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 b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:55:09,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:55:09,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 11:55:09,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:55:09,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:55:10,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:55:10,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:55:10,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:55:10,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:55:10,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:55:10,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:55:10,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:55:10,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:55:10,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:55:10,005 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:55:10,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 11:55:10,006 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 11:55:10,007 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 11:55:10,007 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:55:10,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:55:10,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:55:10,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:55:10,007 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:55:10,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:55:10,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:55:10,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:55:10,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:55:10,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:55:10,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:55:10,008 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:55:10,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:55:10,008 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 11:55:10,008 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 11:55:10,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:55:10,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:55:10,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:55:10,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:55:10,009 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 -> b9ce4e199e47d30d5336dd9ca9dceb5f51006e4e1d59090b80d072b498beba7b [2025-03-03 11:55:10,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:55:10,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:55:10,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:55:10,230 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:55:10,230 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:55:10,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2025-03-03 11:55:11,368 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c566963/b4709a5430e0405abf8091f7e02db957/FLAG0a3aeba78 [2025-03-03 11:55:11,542 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:55:11,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2025-03-03 11:55:11,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c566963/b4709a5430e0405abf8091f7e02db957/FLAG0a3aeba78 [2025-03-03 11:55:11,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36c566963/b4709a5430e0405abf8091f7e02db957 [2025-03-03 11:55:11,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:55:11,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:55:11,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:55:11,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:55:11,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:55:11,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:11" (1/1) ... [2025-03-03 11:55:11,930 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d32f2cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:11, skipping insertion in model container [2025-03-03 11:55:11,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:55:11" (1/1) ... [2025-03-03 11:55:11,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:55:12,061 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-newlib/double_req_bl_1231b.c[1765,1778] [2025-03-03 11:55:12,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:55:12,078 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:55:12,098 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-newlib/double_req_bl_1231b.c[1765,1778] [2025-03-03 11:55:12,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:55:12,113 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:55:12,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12 WrapperNode [2025-03-03 11:55:12,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:55:12,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:55:12,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:55:12,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:55:12,121 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:55:12" (1/1) ... [2025-03-03 11:55:12,129 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:55:12" (1/1) ... [2025-03-03 11:55:12,140 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2025-03-03 11:55:12,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:55:12,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:55:12,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:55:12,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:55:12,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,166 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [3, 2]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 1 writes are split as follows [1, 0]. [2025-03-03 11:55:12,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,179 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:55:12,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:55:12,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:55:12,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:55:12,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (1/1) ... [2025-03-03 11:55:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:55:12,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:55:12,219 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:55:12,222 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:55:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:55:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-03 11:55:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-03 11:55:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 11:55:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 11:55:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 11:55:12,242 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2025-03-03 11:55:12,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2025-03-03 11:55:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-03 11:55:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-03 11:55:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:55:12,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:55:12,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 11:55:12,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:55:12,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:55:12,463 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 11:55:12,466 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:55:12,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:55:12,474 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:55:12,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:12 BoogieIcfgContainer [2025-03-03 11:55:12,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:55:12,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:55:12,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:55:12,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:55:12,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:55:11" (1/3) ... [2025-03-03 11:55:12,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574467c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:12, skipping insertion in model container [2025-03-03 11:55:12,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:55:12" (2/3) ... [2025-03-03 11:55:12,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@574467c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:55:12, skipping insertion in model container [2025-03-03 11:55:12,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:12" (3/3) ... [2025-03-03 11:55:12,485 INFO L128 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2025-03-03 11:55:12,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:55:12,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG double_req_bl_1231b.c that has 2 procedures, 25 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:55:12,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:55:12,539 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;@275fa3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:55:12,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:55:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 11:55:12,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 11:55:12,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:12,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:12,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:12,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1391657577, now seen corresponding path program 1 times [2025-03-03 11:55:12,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:12,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949364353] [2025-03-03 11:55:12,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:12,560 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:55:12,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:12,562 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:55:12,563 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:55:12,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 11:55:12,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 11:55:12,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:12,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:12,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 11:55:12,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:12,647 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:55:12,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:12,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949364353] [2025-03-03 11:55:12,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949364353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:12,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:12,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 11:55:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356759046] [2025-03-03 11:55:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:12,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 11:55:12,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:12,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 11:55:12,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 11:55:12,665 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:12,675 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2025-03-03 11:55:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 11:55:12,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-03 11:55:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:12,680 INFO L225 Difference]: With dead ends: 45 [2025-03-03 11:55:12,680 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 11:55:12,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:55:12,684 INFO L435 NwaCegarLoop]: 32 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, 32 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:55:12,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:12,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 11:55:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 11:55:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 11:55:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-03-03 11:55:12,706 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2025-03-03 11:55:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:12,707 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-03-03 11:55:12,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:12,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2025-03-03 11:55:12,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 11:55:12,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:12,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:12,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 11:55:12,909 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:55:12,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:12,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:12,910 INFO L85 PathProgramCache]: Analyzing trace with hash 919459099, now seen corresponding path program 1 times [2025-03-03 11:55:12,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:12,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042017760] [2025-03-03 11:55:12,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:12,910 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:55:12,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:12,912 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:55:12,913 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:55:12,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 11:55:12,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 11:55:12,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:12,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:12,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:12,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:13,020 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:55:13,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:13,020 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:13,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042017760] [2025-03-03 11:55:13,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042017760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:13,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:13,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052550144] [2025-03-03 11:55:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:13,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:13,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:13,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:13,022 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:13,051 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-03-03 11:55:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:13,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-03 11:55:13,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:13,053 INFO L225 Difference]: With dead ends: 28 [2025-03-03 11:55:13,054 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 11:55:13,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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:55:13,054 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:13,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 11:55:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 11:55:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 11:55:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-03 11:55:13,059 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2025-03-03 11:55:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:13,060 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-03 11:55:13,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-03 11:55:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 11:55:13,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:13,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:13,066 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 (3)] Ended with exit code 0 [2025-03-03 11:55:13,263 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:55:13,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:13,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash -944395987, now seen corresponding path program 1 times [2025-03-03 11:55:13,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:13,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975769868] [2025-03-03 11:55:13,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:55:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:13,292 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:55:13,293 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:55:13,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 11:55:13,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 11:55:13,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:13,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:13,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:13,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:13,400 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:55:13,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:13,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:13,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975769868] [2025-03-03 11:55:13,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975769868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:13,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:13,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:13,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12759614] [2025-03-03 11:55:13,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:13,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:13,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:13,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:13,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:13,403 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:13,424 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-03-03 11:55:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:13,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-03 11:55:13,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:13,425 INFO L225 Difference]: With dead ends: 31 [2025-03-03 11:55:13,425 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 11:55:13,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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:55:13,426 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:13,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 11:55:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-03 11:55:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 11:55:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-03 11:55:13,433 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2025-03-03 11:55:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:13,433 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-03 11:55:13,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-03 11:55:13,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 11:55:13,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:13,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:13,437 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:55:13,634 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:55:13,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:13,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1192478498, now seen corresponding path program 1 times [2025-03-03 11:55:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:13,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781957771] [2025-03-03 11:55:13,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:13,635 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:55:13,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:13,637 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:55:13,638 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:55:13,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 11:55:13,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 11:55:13,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:13,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:13,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:13,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:13,709 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:55:13,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:13,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781957771] [2025-03-03 11:55:13,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781957771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:13,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:13,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509519175] [2025-03-03 11:55:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:13,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:13,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:13,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:13,711 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:13,734 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-03-03 11:55:13,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:13,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-03 11:55:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:13,735 INFO L225 Difference]: With dead ends: 31 [2025-03-03 11:55:13,735 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 11:55:13,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:55:13,735 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:13,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 11:55:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-03 11:55:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 11:55:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-03 11:55:13,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2025-03-03 11:55:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:13,741 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-03 11:55:13,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-03 11:55:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 11:55:13,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:13,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:13,746 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:55:13,945 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:55:13,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:13,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:13,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1403748560, now seen corresponding path program 1 times [2025-03-03 11:55:13,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:13,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738387672] [2025-03-03 11:55:13,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:13,946 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:55:13,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:13,948 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:55:13,949 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:55:13,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 11:55:14,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 11:55:14,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:14,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:14,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:14,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:14,030 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:55:14,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:14,030 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:14,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738387672] [2025-03-03 11:55:14,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738387672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:14,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:14,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:14,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603061988] [2025-03-03 11:55:14,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:14,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:14,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:14,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:14,031 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:14,069 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2025-03-03 11:55:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:14,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-03 11:55:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:14,072 INFO L225 Difference]: With dead ends: 31 [2025-03-03 11:55:14,072 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 11:55:14,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:55:14,073 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:14,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 11:55:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-03 11:55:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 11:55:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-03 11:55:14,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2025-03-03 11:55:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:14,078 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-03 11:55:14,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:14,078 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-03 11:55:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 11:55:14,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:14,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:14,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-03 11:55:14,279 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:55:14,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:14,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2003715055, now seen corresponding path program 1 times [2025-03-03 11:55:14,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:14,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220166580] [2025-03-03 11:55:14,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:14,280 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:55:14,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:14,282 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:55:14,283 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:55:14,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 11:55:14,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 11:55:14,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:14,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:14,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 11:55:14,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:14,970 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:55:14,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:14,971 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:14,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220166580] [2025-03-03 11:55:14,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220166580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:14,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:14,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 11:55:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432123498] [2025-03-03 11:55:14,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:14,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 11:55:14,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:14,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 11:55:14,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 11:55:14,973 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:15,533 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2025-03-03 11:55:15,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 11:55:15,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2025-03-03 11:55:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:15,535 INFO L225 Difference]: With dead ends: 41 [2025-03-03 11:55:15,535 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 11:55:15,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-03 11:55:15,536 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:15,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 11:55:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 11:55:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 11:55:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 11:55:15,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2025-03-03 11:55:15,540 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2025-03-03 11:55:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:15,540 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2025-03-03 11:55:15,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 11:55:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2025-03-03 11:55:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 11:55:15,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:15,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:15,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-03 11:55:15,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:55:15,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:15,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash 542955741, now seen corresponding path program 1 times [2025-03-03 11:55:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855367449] [2025-03-03 11:55:15,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:15,745 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:55:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:15,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 11:55:15,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-03 11:55:15,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 11:55:15,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 11:55:15,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:15,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:15,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 11:55:15,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:15,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:15,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855367449] [2025-03-03 11:55:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855367449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:15,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:15,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:15,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612284869] [2025-03-03 11:55:15,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:15,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:15,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:15,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:15,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:15,827 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:15,852 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-03 11:55:15,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:15,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-03 11:55:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:15,854 INFO L225 Difference]: With dead ends: 30 [2025-03-03 11:55:15,854 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 11:55:15,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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:55:15,854 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:15,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 11:55:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 11:55:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 11:55:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2025-03-03 11:55:15,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2025-03-03 11:55:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:15,864 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2025-03-03 11:55:15,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2025-03-03 11:55:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 11:55:15,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:15,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:15,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-03 11:55:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:55:16,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:16,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash 543015323, now seen corresponding path program 1 times [2025-03-03 11:55:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573043807] [2025-03-03 11:55:16,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:16,066 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:55:16,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:16,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 11:55:16,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-03 11:55:16,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 11:55:16,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 11:55:16,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:16,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:16,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 11:55:16,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 11:55:16,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:16,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:16,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573043807] [2025-03-03 11:55:16,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573043807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:16,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:16,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 11:55:16,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361711533] [2025-03-03 11:55:16,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:16,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:55:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:16,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:55:16,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:55:16,310 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:16,517 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-03 11:55:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:55:16,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-03-03 11:55:16,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:16,518 INFO L225 Difference]: With dead ends: 31 [2025-03-03 11:55:16,518 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 11:55:16,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:55:16,519 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:16,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:55:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 11:55:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-03-03 11:55:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 11:55:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-03 11:55:16,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2025-03-03 11:55:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:16,524 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-03 11:55:16,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-03 11:55:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 11:55:16,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:16,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:16,531 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 (9)] Ended with exit code 0 [2025-03-03 11:55:16,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:55:16,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:16,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash 328781713, now seen corresponding path program 1 times [2025-03-03 11:55:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26909259] [2025-03-03 11:55:16,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:16,727 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:55:16,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:16,729 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 11:55:16,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-03 11:55:16,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 11:55:16,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 11:55:16,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:16,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:16,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:16,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 11:55:16,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:16,805 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:16,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26909259] [2025-03-03 11:55:16,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26909259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606285680] [2025-03-03 11:55:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:16,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:16,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:16,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:16,807 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:16,831 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-03 11:55:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-03 11:55:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:16,831 INFO L225 Difference]: With dead ends: 32 [2025-03-03 11:55:16,832 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 11:55:16,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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:55:16,832 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:16,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 11:55:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 11:55:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 11:55:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-03 11:55:16,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2025-03-03 11:55:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:16,839 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-03 11:55:16,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-03 11:55:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 11:55:16,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:16,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:16,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-03 11:55:17,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:55:17,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:17,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash 328841295, now seen corresponding path program 1 times [2025-03-03 11:55:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188673517] [2025-03-03 11:55:17,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:17,043 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:55:17,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:17,044 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 11:55:17,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-03 11:55:17,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 11:55:17,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 11:55:17,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:17,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 11:55:17,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 11:55:17,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:17,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:17,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188673517] [2025-03-03 11:55:17,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188673517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:17,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:17,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 11:55:17,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943252746] [2025-03-03 11:55:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:17,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:55:17,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:17,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:55:17,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:55:17,267 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:17,532 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-03-03 11:55:17,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:55:17,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-03 11:55:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:17,533 INFO L225 Difference]: With dead ends: 33 [2025-03-03 11:55:17,533 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 11:55:17,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:55:17,534 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:17,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:55:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 11:55:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-03 11:55:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 11:55:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-03 11:55:17,541 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 24 [2025-03-03 11:55:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:17,541 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-03 11:55:17,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-03 11:55:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 11:55:17,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:17,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:17,546 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 (11)] Ended with exit code 0 [2025-03-03 11:55:17,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:55:17,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:17,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:17,743 INFO L85 PathProgramCache]: Analyzing trace with hash -318795552, now seen corresponding path program 1 times [2025-03-03 11:55:17,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:17,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859315215] [2025-03-03 11:55:17,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:17,743 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:55:17,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:17,745 INFO L229 MonitoredProcess]: Starting monitored process 12 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:55:17,746 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 (12)] Waiting until timeout for monitored process [2025-03-03 11:55:17,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 11:55:17,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 11:55:17,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:17,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:17,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:17,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 11:55:17,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:17,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:17,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859315215] [2025-03-03 11:55:17,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859315215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:17,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:17,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735894686] [2025-03-03 11:55:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:17,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:17,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:17,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:17,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:17,816 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:17,837 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2025-03-03 11:55:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:17,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-03 11:55:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:17,838 INFO L225 Difference]: With dead ends: 32 [2025-03-03 11:55:17,838 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 11:55:17,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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:55:17,838 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:17,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 11:55:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 11:55:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 11:55:17,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2025-03-03 11:55:17,842 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2025-03-03 11:55:17,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:17,842 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2025-03-03 11:55:17,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2025-03-03 11:55:17,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 11:55:17,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:17,843 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:17,848 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 (12)] Ended with exit code 0 [2025-03-03 11:55:18,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:55:18,044 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:18,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash -318735970, now seen corresponding path program 1 times [2025-03-03 11:55:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:18,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512014499] [2025-03-03 11:55:18,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:18,044 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:55:18,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:18,046 INFO L229 MonitoredProcess]: Starting monitored process 13 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:55:18,048 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 (13)] Waiting until timeout for monitored process [2025-03-03 11:55:18,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 11:55:18,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 11:55:18,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:18,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:18,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 11:55:18,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 11:55:18,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:18,273 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:18,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512014499] [2025-03-03 11:55:18,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512014499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:18,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 11:55:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143811626] [2025-03-03 11:55:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:18,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:55:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:18,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:55:18,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:55:18,274 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:18,486 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2025-03-03 11:55:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:55:18,486 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-03 11:55:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:18,487 INFO L225 Difference]: With dead ends: 35 [2025-03-03 11:55:18,487 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 11:55:18,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:55:18,487 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:18,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 61 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:55:18,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 11:55:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-03-03 11:55:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 11:55:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2025-03-03 11:55:18,490 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 25 [2025-03-03 11:55:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:18,490 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2025-03-03 11:55:18,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2025-03-03 11:55:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 11:55:18,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:18,491 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:18,495 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 (13)] Ended with exit code 0 [2025-03-03 11:55:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:55:18,691 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:18,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:18,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1516971276, now seen corresponding path program 1 times [2025-03-03 11:55:18,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:18,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52741917] [2025-03-03 11:55:18,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:18,692 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:55:18,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:18,695 INFO L229 MonitoredProcess]: Starting monitored process 14 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:55:18,696 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 (14)] Waiting until timeout for monitored process [2025-03-03 11:55:18,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 11:55:18,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 11:55:18,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:18,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:18,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:18,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 11:55:18,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:18,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52741917] [2025-03-03 11:55:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52741917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845065200] [2025-03-03 11:55:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:18,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:18,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:18,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:18,775 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:18,797 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-03 11:55:18,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:18,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-03 11:55:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:18,797 INFO L225 Difference]: With dead ends: 30 [2025-03-03 11:55:18,797 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 11:55:18,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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:55:18,798 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:18,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 11:55:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-03 11:55:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 11:55:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-03 11:55:18,801 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 26 [2025-03-03 11:55:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:18,801 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-03 11:55:18,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-03 11:55:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 11:55:18,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:18,802 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:18,807 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 (14)] Ended with exit code 0 [2025-03-03 11:55:19,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:55:19,003 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:19,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:19,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1516911694, now seen corresponding path program 1 times [2025-03-03 11:55:19,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:19,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387732999] [2025-03-03 11:55:19,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:19,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:55:19,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:19,006 INFO L229 MonitoredProcess]: Starting monitored process 15 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:55:19,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-03 11:55:19,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 11:55:19,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 11:55:19,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:19,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:19,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 11:55:19,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 11:55:19,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:19,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:19,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387732999] [2025-03-03 11:55:19,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387732999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:19,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:19,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 11:55:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209676088] [2025-03-03 11:55:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:19,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:55:19,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:19,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:55:19,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:55:19,254 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:19,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:19,460 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-03 11:55:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:55:19,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-03 11:55:19,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:19,461 INFO L225 Difference]: With dead ends: 31 [2025-03-03 11:55:19,462 INFO L226 Difference]: Without dead ends: 26 [2025-03-03 11:55:19,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 11:55:19,462 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:19,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 11:55:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-03 11:55:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-03-03 11:55:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 11:55:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-03 11:55:19,465 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2025-03-03 11:55:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:19,465 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-03 11:55:19,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-03 11:55:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 11:55:19,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:19,466 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:19,470 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 (15)] Forceful destruction successful, exit code 0 [2025-03-03 11:55:19,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:55:19,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:19,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash -629467595, now seen corresponding path program 1 times [2025-03-03 11:55:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:19,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914647074] [2025-03-03 11:55:19,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:19,667 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:55:19,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:19,669 INFO L229 MonitoredProcess]: Starting monitored process 16 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:55:19,670 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 (16)] Waiting until timeout for monitored process [2025-03-03 11:55:19,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 11:55:19,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 11:55:19,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:19,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:19,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 11:55:19,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 11:55:20,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:55:20,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:20,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914647074] [2025-03-03 11:55:20,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914647074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:55:20,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [258339497] [2025-03-03 11:55:20,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:20,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 11:55:20,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 11:55:20,272 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 11:55:20,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-03 11:55:20,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 11:55:20,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 11:55:20,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:20,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:20,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 11:55:20,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 11:55:20,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [258339497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:20,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 11:55:20,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-03-03 11:55:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478320345] [2025-03-03 11:55:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:20,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:55:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:20,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:55:20,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-03 11:55:20,674 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:20,718 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-03 11:55:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 11:55:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-03 11:55:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:20,720 INFO L225 Difference]: With dead ends: 27 [2025-03-03 11:55:20,720 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 11:55:20,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-03 11:55:20,721 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:20,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 11:55:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 11:55:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 11:55:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-03 11:55:20,725 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 26 [2025-03-03 11:55:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:20,725 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-03 11:55:20,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-03 11:55:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 11:55:20,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:55:20,726 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:20,733 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 (16)] Ended with exit code 0 [2025-03-03 11:55:20,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-03 11:55:21,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 11:55:21,127 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:55:21,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:55:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash -629408013, now seen corresponding path program 1 times [2025-03-03 11:55:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:55:21,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595485417] [2025-03-03 11:55:21,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:55:21,127 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:55:21,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:55:21,129 INFO L229 MonitoredProcess]: Starting monitored process 18 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:55:21,130 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 (18)] Waiting until timeout for monitored process [2025-03-03 11:55:21,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 11:55:21,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 11:55:21,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:55:21,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:55:21,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:55:21,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:55:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 11:55:21,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:55:21,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:55:21,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595485417] [2025-03-03 11:55:21,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595485417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:55:21,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:55:21,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:55:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165373756] [2025-03-03 11:55:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:55:21,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:55:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:55:21,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:55:21,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:55:21,206 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:55:21,217 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-03-03 11:55:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:55:21,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-03 11:55:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:55:21,218 INFO L225 Difference]: With dead ends: 23 [2025-03-03 11:55:21,218 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 11:55:21,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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:55:21,219 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:55:21,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:55:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 11:55:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 11:55:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:55:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 11:55:21,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2025-03-03 11:55:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:55:21,219 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 11:55:21,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 11:55:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 11:55:21,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 11:55:21,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 11:55:21,226 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 (18)] Ended with exit code 0 [2025-03-03 11:55:21,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:55:21,425 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 11:55:21,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 11:55:23,138 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:55:23,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:55:23 BoogieIcfgContainer [2025-03-03 11:55:23,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:55:23,149 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:55:23,149 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:55:23,149 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:55:23,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:55:12" (3/4) ... [2025-03-03 11:55:23,151 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 11:55:23,155 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2025-03-03 11:55:23,159 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-03 11:55:23,160 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-03 11:55:23,160 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 11:55:23,160 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 11:55:23,184 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-03-03 11:55:23,197 WARN L140 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(x) == x) [2025-03-03 11:55:23,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 11:55:23,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 11:55:23,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:55:23,224 INFO L158 Benchmark]: Toolchain (without parser) took 11299.42ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 59.7MB in the end (delta: 32.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2025-03-03 11:55:23,225 INFO L158 Benchmark]: CDTParser took 2.30ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:23,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.72ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:23,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.44ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:55:23,225 INFO L158 Benchmark]: Boogie Preprocessor took 44.37ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:23,225 INFO L158 Benchmark]: IcfgBuilder took 287.96ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 63.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:23,226 INFO L158 Benchmark]: TraceAbstraction took 10670.88ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 66.0MB in the end (delta: -3.2MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-03-03 11:55:23,226 INFO L158 Benchmark]: Witness Printer took 75.29ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 59.7MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:55:23,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.30ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 62.2MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.72ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 79.7MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.44ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.37ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 287.96ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 63.3MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10670.88ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 66.0MB in the end (delta: -3.2MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 75.29ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 59.7MB in the end (delta: 6.3MB). 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 - PositiveResult [Line: 70]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 1103 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 740 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 363 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=9, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 355 ConstructedInterpolants, 58 QuantifiedInterpolants, 1789 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1293 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 61/66 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Location Invariant Derived location invariant: (\old(x) == x) RESULT: Ultimate proved your program to be correct! [2025-03-03 11:55:23,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE