./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/floats-cbmc-regression/float18.i -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 a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:43:07,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:43:07,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:43:07,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:43:07,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:43:07,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:43:07,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:43:07,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:43:07,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:43:07,603 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:43:07,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:43:07,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:43:07,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:43:07,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:43:07,604 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:43:07,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:43:07,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:43:07,604 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:43:07,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:43:07,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:43:07,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:43:07,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:43:07,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:43:07,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:43:07,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:43:07,607 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 -> a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 [2025-03-08 02:43:07,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:43:07,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:43:07,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:43:07,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:43:07,855 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:43:07,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float18.i [2025-03-08 02:43:08,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c2101df/b346fb8d15d8482fbf8074f832d765a2/FLAGec73819d9 [2025-03-08 02:43:09,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:43:09,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i [2025-03-08 02:43:09,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c2101df/b346fb8d15d8482fbf8074f832d765a2/FLAGec73819d9 [2025-03-08 02:43:09,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c2101df/b346fb8d15d8482fbf8074f832d765a2 [2025-03-08 02:43:09,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:43:09,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:43:09,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:43:09,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:43:09,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:43:09,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:09,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b640b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09, skipping insertion in model container [2025-03-08 02:43:09,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:09,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:43:09,898 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/floats-cbmc-regression/float18.i[40835,40848] [2025-03-08 02:43:09,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:43:09,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:43:09,929 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/floats-cbmc-regression/float18.i[40835,40848] [2025-03-08 02:43:09,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:43:09,993 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:43:09,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09 WrapperNode [2025-03-08 02:43:09,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:43:09,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:43:09,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:43:09,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:43:09,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,019 INFO L138 Inliner]: procedures = 446, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-03-08 02:43:10,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:43:10,019 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:43:10,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:43:10,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:43:10,024 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,029 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:43:10,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:43:10,036 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:43:10,036 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:43:10,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:43:10,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (1/1) ... [2025-03-08 02:43:10,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:43:10,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:43:10,058 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-08 02:43:10,059 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-08 02:43:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:43:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:43:10,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:43:10,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:43:10,121 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:43:10,123 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:43:10,169 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 02:43:10,169 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:43:10,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:43:10,174 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:43:10,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:10 BoogieIcfgContainer [2025-03-08 02:43:10,175 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:43:10,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:43:10,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:43:10,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:43:10,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:43:09" (1/3) ... [2025-03-08 02:43:10,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cd36cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:43:10, skipping insertion in model container [2025-03-08 02:43:10,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:09" (2/3) ... [2025-03-08 02:43:10,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cd36cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:43:10, skipping insertion in model container [2025-03-08 02:43:10,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:10" (3/3) ... [2025-03-08 02:43:10,181 INFO L128 eAbstractionObserver]: Analyzing ICFG float18.i [2025-03-08 02:43:10,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:43:10,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float18.i that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:43:10,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:43:10,236 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;@2b2da88d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:43:10,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:43:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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-08 02:43:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 02:43:10,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:43:10,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 02:43:10,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:43:10,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:43:10,249 INFO L85 PathProgramCache]: Analyzing trace with hash 38140263, now seen corresponding path program 1 times [2025-03-08 02:43:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:43:10,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181733778] [2025-03-08 02:43:10,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:43:10,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:43:10,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 02:43:10,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 02:43:10,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:43:10,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:10,332 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-08 02:43:10,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:43:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181733778] [2025-03-08 02:43:10,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181733778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:43:10,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:43:10,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:43:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894457015] [2025-03-08 02:43:10,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:43:10,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 02:43:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:43:10,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 02:43:10,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 02:43:10,350 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 02:43:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:43:10,357 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2025-03-08 02:43:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 02:43:10,358 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 02:43:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:43:10,362 INFO L225 Difference]: With dead ends: 16 [2025-03-08 02:43:10,363 INFO L226 Difference]: Without dead ends: 7 [2025-03-08 02:43:10,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 02:43:10,366 INFO L435 NwaCegarLoop]: 10 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, 10 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-08 02:43:10,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:43:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-08 02:43:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-08 02:43:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-08 02:43:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-08 02:43:10,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-08 02:43:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:43:10,388 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-08 02:43:10,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 02:43:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-08 02:43:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 02:43:10,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:43:10,388 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 02:43:10,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:43:10,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:43:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:43:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1182321278, now seen corresponding path program 1 times [2025-03-08 02:43:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:43:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906369989] [2025-03-08 02:43:10,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:43:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:43:10,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 02:43:10,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 02:43:10,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:43:10,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:10,469 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-08 02:43:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:43:10,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906369989] [2025-03-08 02:43:10,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906369989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:43:10,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:43:10,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:43:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539291458] [2025-03-08 02:43:10,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:43:10,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:43:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:43:10,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:43:10,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:43:10,471 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-08 02:43:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:43:10,481 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-08 02:43:10,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:43:10,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 02:43:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:43:10,482 INFO L225 Difference]: With dead ends: 13 [2025-03-08 02:43:10,482 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 02:43:10,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:43:10,482 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 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-08 02:43:10,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:43:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 02:43:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 02:43:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 02:43:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 02:43:10,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2025-03-08 02:43:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:43:10,485 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 02:43:10,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-08 02:43:10,485 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 02:43:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 02:43:10,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:43:10,486 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 02:43:10,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:43:10,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:43:10,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:43:10,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1956385700, now seen corresponding path program 1 times [2025-03-08 02:43:10,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:43:10,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902911414] [2025-03-08 02:43:10,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:43:10,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:43:10,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 02:43:10,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 02:43:10,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:43:10,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:43:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:43:10,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902911414] [2025-03-08 02:43:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902911414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:43:10,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061077514] [2025-03-08 02:43:10,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:43:10,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:43:10,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:43:10,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:43:10,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:43:10,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 02:43:10,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 02:43:10,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:43:10,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:10,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:43:10,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:43:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:43:10,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:43:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:43:10,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061077514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:43:10,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:43:10,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 02:43:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210302827] [2025-03-08 02:43:10,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:43:10,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:43:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:43:10,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:43:10,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:43:10,682 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:43:10,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:43:10,694 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-03-08 02:43:10,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 02:43:10,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 02:43:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:43:10,695 INFO L225 Difference]: With dead ends: 24 [2025-03-08 02:43:10,695 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 02:43:10,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:43:10,696 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:43:10,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:43:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 02:43:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-08 02:43:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-08 02:43:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-03-08 02:43:10,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2025-03-08 02:43:10,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:43:10,699 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-03-08 02:43:10,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:43:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-03-08 02:43:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 02:43:10,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:43:10,700 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2025-03-08 02:43:10,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:43:10,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:43:10,901 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:43:10,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:43:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1136576300, now seen corresponding path program 2 times [2025-03-08 02:43:10,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:43:10,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823849288] [2025-03-08 02:43:10,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 02:43:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:43:10,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 02:43:10,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 02:43:10,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 02:43:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:43:11,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:43:11,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823849288] [2025-03-08 02:43:11,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823849288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:43:11,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661054508] [2025-03-08 02:43:11,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 02:43:11,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:43:11,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:43:11,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:43:11,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:43:11,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-08 02:43:11,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 02:43:11,040 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 02:43:11,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:11,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 02:43:11,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:43:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:43:11,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:43:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:43:11,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661054508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:43:11,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:43:11,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 02:43:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128465070] [2025-03-08 02:43:11,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:43:11,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 02:43:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:43:11,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 02:43:11,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2025-03-08 02:43:11,183 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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-08 02:43:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:43:11,197 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2025-03-08 02:43:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 02:43:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 02:43:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:43:11,198 INFO L225 Difference]: With dead ends: 35 [2025-03-08 02:43:11,198 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 02:43:11,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2025-03-08 02:43:11,198 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:43:11,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:43:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 02:43:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-08 02:43:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-08 02:43:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-03-08 02:43:11,201 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 16 [2025-03-08 02:43:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:43:11,202 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-03-08 02:43:11,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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-08 02:43:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-03-08 02:43:11,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 02:43:11,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:43:11,202 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2025-03-08 02:43:11,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:43:11,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 02:43:11,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:43:11,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:43:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash -508808278, now seen corresponding path program 3 times [2025-03-08 02:43:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:43:11,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238095662] [2025-03-08 02:43:11,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 02:43:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:43:11,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 11 equivalence classes. [2025-03-08 02:43:11,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 02:43:11,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 02:43:11,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 02:43:11,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 02:43:11,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 02:43:11,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 02:43:11,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:43:11,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 02:43:11,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 02:43:11,454 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 02:43:11,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:43:11,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:43:11,458 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-03-08 02:43:11,473 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:43:11,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:43:11 BoogieIcfgContainer [2025-03-08 02:43:11,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:43:11,476 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:43:11,476 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:43:11,476 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:43:11,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:10" (3/4) ... [2025-03-08 02:43:11,478 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 02:43:11,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:43:11,479 INFO L158 Benchmark]: Toolchain (without parser) took 1916.55ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 66.2MB in the end (delta: 44.8MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2025-03-08 02:43:11,479 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:43:11,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.68ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 68.6MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 02:43:11,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.61ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 66.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:43:11,479 INFO L158 Benchmark]: Boogie Preprocessor took 16.17ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 65.8MB in the end (delta: 956.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:43:11,480 INFO L158 Benchmark]: IcfgBuilder took 138.86ms. Allocated memory is still 142.6MB. Free memory was 65.4MB in the beginning and 55.9MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 02:43:11,480 INFO L158 Benchmark]: TraceAbstraction took 1298.74ms. Allocated memory is still 142.6MB. Free memory was 55.0MB in the beginning and 67.0MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:43:11,480 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 66.2MB in the end (delta: 784.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:43:11,481 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.68ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 68.6MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.61ms. Allocated memory is still 142.6MB. Free memory was 68.6MB in the beginning and 66.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.17ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 65.8MB in the end (delta: 956.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 138.86ms. Allocated memory is still 142.6MB. Free memory was 65.4MB in the beginning and 55.9MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1298.74ms. Allocated memory is still 142.6MB. Free memory was 55.0MB in the beginning and 67.0MB in the end (delta: -12.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 66.2MB in the end (delta: 784.1kB). 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: 979]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 968, overapproximation of someBinaryArithmeticDOUBLEoperation at line 974, overapproximation of someBinaryDOUBLEComparisonOperation at line 977. Possible FailurePath: [L968] double s, f=0.0, fStep=0.1*3.14159265358979323846; [L969] int n=0; VAL [n=0] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=1] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=1] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=2] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=2] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=3] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=3] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=4] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=4] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=5] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=5] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=6] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=6] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=7] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=7] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=8] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=8] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=9] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=9] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=10] [L977] COND TRUE f < 3.14159265358979323846 VAL [n=10] [L977] COND TRUE f < 3.14159265358979323846 [L973] s = sin(f) [L974] f += fStep [L975] n++ VAL [n=11] [L977] COND FALSE !(f < 3.14159265358979323846) VAL [n=11] [L979] COND TRUE !( n < 11 ) [L979] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 12 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 5, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 28 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/96 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-08 02:43:11,492 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/floats-cbmc-regression/float18.i -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 a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:43:13,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:43:13,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 02:43:13,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:43:13,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:43:13,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:43:13,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:43:13,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:43:13,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:43:13,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:43:13,409 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:43:13,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:43:13,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:43:13,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:43:13,410 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:43:13,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:43:13,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:43:13,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:43:13,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:43:13,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:43:13,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:43:13,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:43:13,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:43:13,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:43:13,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:43:13,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:43:13,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:43:13,413 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 -> a81fa1bd0a3b8841e651932cc73584f5a646612c64d8453e7e96316c7083da49 [2025-03-08 02:43:13,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:43:13,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:43:13,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:43:13,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:43:13,677 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:43:13,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float18.i [2025-03-08 02:43:14,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e13af034/5c49edd54b194a379434b5478dcb55c8/FLAGe71bb01b3 [2025-03-08 02:43:15,064 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:43:15,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float18.i [2025-03-08 02:43:15,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e13af034/5c49edd54b194a379434b5478dcb55c8/FLAGe71bb01b3 [2025-03-08 02:43:15,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e13af034/5c49edd54b194a379434b5478dcb55c8 [2025-03-08 02:43:15,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:43:15,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:43:15,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:43:15,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:43:15,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:43:15,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73816782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15, skipping insertion in model container [2025-03-08 02:43:15,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:43:15,689 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/floats-cbmc-regression/float18.i[40835,40848] [2025-03-08 02:43:15,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:43:15,701 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:43:15,728 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/floats-cbmc-regression/float18.i[40835,40848] [2025-03-08 02:43:15,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:43:15,791 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:43:15,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15 WrapperNode [2025-03-08 02:43:15,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:43:15,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:43:15,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:43:15,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:43:15,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,823 INFO L138 Inliner]: procedures = 447, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2025-03-08 02:43:15,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:43:15,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:43:15,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:43:15,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:43:15,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,836 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:43:15,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:43:15,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:43:15,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:43:15,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:43:15,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (1/1) ... [2025-03-08 02:43:15,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:43:15,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:43:15,868 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-08 02:43:15,870 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-08 02:43:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 02:43:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:43:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:43:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:43:15,941 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:43:15,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:43:16,298 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 02:43:16,298 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:43:16,303 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:43:16,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:43:16,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:16 BoogieIcfgContainer [2025-03-08 02:43:16,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:43:16,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:43:16,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:43:16,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:43:16,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:43:15" (1/3) ... [2025-03-08 02:43:16,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b388fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:43:16, skipping insertion in model container [2025-03-08 02:43:16,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:43:15" (2/3) ... [2025-03-08 02:43:16,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b388fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:43:16, skipping insertion in model container [2025-03-08 02:43:16,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:43:16" (3/3) ... [2025-03-08 02:43:16,310 INFO L128 eAbstractionObserver]: Analyzing ICFG float18.i [2025-03-08 02:43:16,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:43:16,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float18.i that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:43:16,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:43:16,362 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;@4a4e18d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:43:16,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:43:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 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-08 02:43:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 02:43:16,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:43:16,371 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 02:43:16,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:43:16,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:43:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash 38140263, now seen corresponding path program 1 times [2025-03-08 02:43:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:43:16,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636509094] [2025-03-08 02:43:16,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:43:16,386 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-08 02:43:16,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:43:16,390 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-08 02:43:16,392 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-08 02:43:16,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 02:43:16,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 02:43:16,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:43:16,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:16,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 02:43:16,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:43:16,596 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-08 02:43:16,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:43:16,597 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:43:16,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636509094] [2025-03-08 02:43:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636509094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:43:16,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:43:16,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:43:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326947407] [2025-03-08 02:43:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:43:16,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 02:43:16,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:43:16,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 02:43:16,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 02:43:16,618 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 02:43:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:43:16,624 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2025-03-08 02:43:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 02:43:16,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 02:43:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:43:16,630 INFO L225 Difference]: With dead ends: 16 [2025-03-08 02:43:16,630 INFO L226 Difference]: Without dead ends: 7 [2025-03-08 02:43:16,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-08 02:43:16,634 INFO L435 NwaCegarLoop]: 10 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, 10 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-08 02:43:16,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:43:16,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-08 02:43:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-08 02:43:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-08 02:43:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-08 02:43:16,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-08 02:43:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:43:16,653 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-08 02:43:16,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-08 02:43:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-08 02:43:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 02:43:16,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:43:16,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 02:43:16,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:43:16,854 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-08 02:43:16,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:43:16,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:43:16,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1182321278, now seen corresponding path program 1 times [2025-03-08 02:43:16,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:43:16,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140942747] [2025-03-08 02:43:16,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:43:16,855 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-08 02:43:16,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:43:16,857 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-08 02:43:16,857 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-08 02:43:16,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 02:43:17,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 02:43:17,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:43:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:17,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:43:17,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:43:18,105 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-08 02:43:18,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:43:18,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:43:18,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140942747] [2025-03-08 02:43:18,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140942747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:43:18,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:43:18,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:43:18,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904941703] [2025-03-08 02:43:18,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:43:18,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:43:18,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:43:18,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:43:18,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:43:18,106 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-08 02:43:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:43:18,484 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-03-08 02:43:18,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:43:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-08 02:43:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:43:18,486 INFO L225 Difference]: With dead ends: 13 [2025-03-08 02:43:18,486 INFO L226 Difference]: Without dead ends: 10 [2025-03-08 02:43:18,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:43:18,486 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:43:18,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 7 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 02:43:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-08 02:43:18,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-08 02:43:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 02:43:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 02:43:18,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2025-03-08 02:43:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:43:18,488 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 02:43:18,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 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-08 02:43:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 02:43:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 02:43:18,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:43:18,489 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 02:43:18,497 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-08 02:43:18,689 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-08 02:43:18,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:43:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:43:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1956385700, now seen corresponding path program 1 times [2025-03-08 02:43:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:43:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061516828] [2025-03-08 02:43:18,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:43:18,690 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-08 02:43:18,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:43:18,693 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-08 02:43:18,694 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-08 02:43:18,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 02:43:18,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 02:43:18,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:43:18,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:43:18,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 02:43:18,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:43:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:43:21,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:43:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:43:41,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:43:41,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061516828] [2025-03-08 02:43:41,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061516828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:43:41,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:43:41,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-08 02:43:41,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285326561] [2025-03-08 02:43:41,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 02:43:41,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:43:41,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:43:41,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:43:41,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:43:41,730 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:44:06,207 WARN L286 SmtUtils]: Spent 13.32s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 02:44:10,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:44:23,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:44:27,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:44:31,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:44:35,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:44:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:44:35,263 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-08 02:44:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 02:44:35,277 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 02:44:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:44:35,278 INFO L225 Difference]: With dead ends: 18 [2025-03-08 02:44:35,278 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 02:44:35,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 52.9s TimeCoverageRelationStatistics Valid=48, Invalid=83, Unknown=1, NotChecked=0, Total=132 [2025-03-08 02:44:35,278 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:44:35,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 18.2s Time] [2025-03-08 02:44:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 02:44:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 02:44:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:44:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-08 02:44:35,280 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-08 02:44:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:44:35,281 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-08 02:44:35,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:44:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-08 02:44:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:44:35,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:44:35,281 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2025-03-08 02:44:35,291 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-08 02:44:35,482 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-08 02:44:35,482 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:44:35,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:44:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash 749655286, now seen corresponding path program 2 times [2025-03-08 02:44:35,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:44:35,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374148845] [2025-03-08 02:44:35,483 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 02:44:35,483 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-08 02:44:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:44:35,485 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-08 02:44:35,486 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-08 02:44:35,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-08 02:44:35,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:44:35,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 02:44:35,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:44:35,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:44:35,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:44:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:44:36,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:44:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:44:36,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:44:36,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374148845] [2025-03-08 02:44:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374148845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:44:36,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:44:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-03-08 02:44:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258329430] [2025-03-08 02:44:36,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 02:44:36,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 02:44:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:44:36,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 02:44:36,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-08 02:44:36,881 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-08 02:44:38,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 02:44:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:44:40,652 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2025-03-08 02:44:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 02:44:40,652 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 02:44:40,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:44:40,652 INFO L225 Difference]: With dead ends: 36 [2025-03-08 02:44:40,652 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 02:44:40,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2025-03-08 02:44:40,653 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:44:40,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 66 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 02:44:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 02:44:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-08 02:44:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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-08 02:44:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2025-03-08 02:44:40,668 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2025-03-08 02:44:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:44:40,668 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2025-03-08 02:44:40,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-08 02:44:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2025-03-08 02:44:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 02:44:40,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:44:40,669 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2025-03-08 02:44:40,683 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-08 02:44:40,869 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-08 02:44:40,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:44:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:44:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash -508808278, now seen corresponding path program 3 times [2025-03-08 02:44:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:44:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547102868] [2025-03-08 02:44:40,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 02:44:40,870 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-08 02:44:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:44:40,872 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-08 02:44:40,873 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-08 02:44:40,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 11 equivalence classes. [2025-03-08 02:44:42,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 02:44:42,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 02:44:42,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:44:42,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 02:44:42,081 INFO L279 TraceCheckSpWp]: Computing forward predicates...