./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/Muller_Kahan.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/Muller_Kahan.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:33:28,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:33:28,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 11:33:28,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:33:28,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:33:29,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:33:29,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:33:29,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:33:29,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:33:29,013 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:33:29,013 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:33:29,013 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:33:29,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:33:29,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:33:29,014 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:33:29,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:33:29,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:33:29,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:33:29,015 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2025-03-03 11:33:29,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:33:29,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:33:29,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:33:29,255 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:33:29,255 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:33:29,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2025-03-03 11:33:30,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2650f6e9d/3f8398013f7c4ba18f9123b0c5cf0d72/FLAG21d5628af [2025-03-03 11:33:30,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:33:30,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2025-03-03 11:33:30,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2650f6e9d/3f8398013f7c4ba18f9123b0c5cf0d72/FLAG21d5628af [2025-03-03 11:33:30,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2650f6e9d/3f8398013f7c4ba18f9123b0c5cf0d72 [2025-03-03 11:33:30,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:33:30,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:33:30,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:33:30,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:33:30,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:33:30,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:33:30" (1/1) ... [2025-03-03 11:33:30,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cad595b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:30, skipping insertion in model container [2025-03-03 11:33:30,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:33:30" (1/1) ... [2025-03-03 11:33:30,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:33:31,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2025-03-03 11:33:31,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:33:31,067 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:33:31,074 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2025-03-03 11:33:31,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:33:31,087 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:33:31,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31 WrapperNode [2025-03-03 11:33:31,088 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:33:31,089 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:33:31,089 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:33:31,089 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:33:31,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,110 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2025-03-03 11:33:31,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:33:31,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:33:31,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:33:31,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:33:31,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,126 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-03 11:33:31,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,132 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:33:31,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:33:31,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:33:31,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:33:31,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (1/1) ... [2025-03-03 11:33:31,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:33:31,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:33:31,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:33:31,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:33:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:33:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:33:31,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:33:31,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 11:33:31,221 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:33:31,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:33:31,291 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 11:33:31,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:33:31,297 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:33:31,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:33:31,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:31 BoogieIcfgContainer [2025-03-03 11:33:31,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:33:31,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:33:31,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:33:31,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:33:31,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:33:30" (1/3) ... [2025-03-03 11:33:31,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365e8462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:33:31, skipping insertion in model container [2025-03-03 11:33:31,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:31" (2/3) ... [2025-03-03 11:33:31,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365e8462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:33:31, skipping insertion in model container [2025-03-03 11:33:31,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:31" (3/3) ... [2025-03-03 11:33:31,303 INFO L128 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2025-03-03 11:33:31,313 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:33:31,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Muller_Kahan.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:33:31,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:33:31,358 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;@4c006b8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:33:31,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:33:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 11:33:31,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:31,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 11:33:31,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:31,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash 39093671, now seen corresponding path program 1 times [2025-03-03 11:33:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:33:31,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866447896] [2025-03-03 11:33:31,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:33:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:33:31,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 11:33:31,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 11:33:31,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:33:31,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:33:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866447896] [2025-03-03 11:33:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866447896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:33:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:33:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:33:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755979544] [2025-03-03 11:33:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:33:31,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:33:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:33:31,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:33:31,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:33:31,517 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03 11:33:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:33:31,533 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-03 11:33:31,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:33:31,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03 11:33:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:33:31,539 INFO L225 Difference]: With dead ends: 18 [2025-03-03 11:33:31,539 INFO L226 Difference]: Without dead ends: 7 [2025-03-03 11:33:31,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:33:31,544 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:33:31,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:33:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-03 11:33:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-03 11:33:31,563 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-03 11:33:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-03 11:33:31,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-03 11:33:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:33:31,566 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-03 11:33:31,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03 11:33:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-03 11:33:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 11:33:31,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:31,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 11:33:31,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 11:33:31,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1211935550, now seen corresponding path program 1 times [2025-03-03 11:33:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:33:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504339742] [2025-03-03 11:33:31,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:33:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:33:31,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 11:33:31,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 11:33:31,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:33:31,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:31,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:33:31,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504339742] [2025-03-03 11:33:31,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504339742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:33:31,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408629309] [2025-03-03 11:33:31,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:33:31,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:31,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:33:31,617 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-03 11:33:31,619 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-03 11:33:31,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 11:33:31,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 11:33:31,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:33:31,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:31,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:33:31,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:33:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:31,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:33:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:31,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408629309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:33:31,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:33:31,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 11:33:31,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258859213] [2025-03-03 11:33:31,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:33:31,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 11:33:31,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:33:31,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 11:33:31,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:33:31,710 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:33:31,720 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-03-03 11:33:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 11:33:31,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-03 11:33:31,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:33:31,720 INFO L225 Difference]: With dead ends: 13 [2025-03-03 11:33:31,720 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 11:33:31,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 11:33:31,721 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:33:31,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:33:31,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 11:33:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-03 11:33:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-03 11:33:31,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2025-03-03 11:33:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:33:31,725 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-03 11:33:31,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-03 11:33:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 11:33:31,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:31,726 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-03-03 11:33:31,734 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-03 11:33:31,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:31,926 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:31,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1308406631, now seen corresponding path program 2 times [2025-03-03 11:33:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:33:31,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688329586] [2025-03-03 11:33:31,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 11:33:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:33:31,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-03 11:33:31,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 11:33:31,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 11:33:31,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:32,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:33:32,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688329586] [2025-03-03 11:33:32,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688329586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:33:32,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230830471] [2025-03-03 11:33:32,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 11:33:32,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:32,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:33:32,042 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-03 11:33:32,044 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-03 11:33:32,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-03 11:33:32,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 11:33:32,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 11:33:32,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:32,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 11:33:32,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:33:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:32,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:33:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:32,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230830471] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:33:32,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:33:32,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 11:33:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629195221] [2025-03-03 11:33:32,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:33:32,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 11:33:32,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:33:32,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 11:33:32,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-03 11:33:32,167 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-03 11:33:32,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:33:32,180 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2025-03-03 11:33:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 11:33:32,181 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) Word has length 9 [2025-03-03 11:33:32,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:33:32,181 INFO L225 Difference]: With dead ends: 19 [2025-03-03 11:33:32,181 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 11:33:32,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-03 11:33:32,182 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:33:32,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:33:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 11:33:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-03 11:33:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-03 11:33:32,185 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2025-03-03 11:33:32,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:33:32,185 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-03 11:33:32,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-03 11:33:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-03 11:33:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 11:33:32,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:32,186 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-03 11:33:32,192 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-03 11:33:32,386 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,SelfDestructingSolverStorable2 [2025-03-03 11:33:32,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:32,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:32,387 INFO L85 PathProgramCache]: Analyzing trace with hash -731130873, now seen corresponding path program 3 times [2025-03-03 11:33:32,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:33:32,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713452697] [2025-03-03 11:33:32,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 11:33:32,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:33:32,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-03-03 11:33:32,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 11:33:32,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 11:33:32,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:33:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713452697] [2025-03-03 11:33:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713452697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:33:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646832214] [2025-03-03 11:33:32,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 11:33:32,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:32,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:33:32,589 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:33:32,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 11:33:32,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-03-03 11:33:32,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 11:33:32,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 11:33:32,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:32,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 11:33:32,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:33:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:32,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:33:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646832214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:33:32,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:33:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-03 11:33:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677455298] [2025-03-03 11:33:32,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:33:32,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 11:33:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:33:32,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 11:33:32,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-03 11:33:32,856 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 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-03 11:33:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:33:32,882 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-03-03 11:33:32,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 11:33:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 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 15 [2025-03-03 11:33:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:33:32,883 INFO L225 Difference]: With dead ends: 31 [2025-03-03 11:33:32,883 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 11:33:32,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-03 11:33:32,885 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:33:32,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:33:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 11:33:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 11:33:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-03-03 11:33:32,889 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2025-03-03 11:33:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:33:32,889 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-03-03 11:33:32,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 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-03 11:33:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-03-03 11:33:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 11:33:32,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:32,890 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1] [2025-03-03 11:33:32,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 11:33:33,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:33,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:33,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash 764095815, now seen corresponding path program 4 times [2025-03-03 11:33:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:33:33,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789642819] [2025-03-03 11:33:33,091 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 11:33:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:33:33,101 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-03 11:33:33,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 11:33:33,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 11:33:33,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:33,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:33:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789642819] [2025-03-03 11:33:33,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789642819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:33:33,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421361409] [2025-03-03 11:33:33,516 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 11:33:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:33:33,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:33:33,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 11:33:33,553 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-03 11:33:33,571 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 11:33:33,571 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 11:33:33,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:33,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 11:33:33,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:33:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:33,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:33:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:34,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421361409] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:33:34,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:33:34,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2025-03-03 11:33:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645898605] [2025-03-03 11:33:34,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:33:34,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 11:33:34,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:33:34,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 11:33:34,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 11:33:34,257 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:33:34,299 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2025-03-03 11:33:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 11:33:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 27 [2025-03-03 11:33:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:33:34,301 INFO L225 Difference]: With dead ends: 55 [2025-03-03 11:33:34,301 INFO L226 Difference]: Without dead ends: 52 [2025-03-03 11:33:34,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 11:33:34,302 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 11:33:34,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 11:33:34,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-03 11:33:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-03 11:33:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2025-03-03 11:33:34,311 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 27 [2025-03-03 11:33:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:33:34,311 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2025-03-03 11:33:34,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:34,312 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2025-03-03 11:33:34,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 11:33:34,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:34,313 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1] [2025-03-03 11:33:34,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 11:33:34,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:34,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:34,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2128199737, now seen corresponding path program 5 times [2025-03-03 11:33:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:33:34,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377672704] [2025-03-03 11:33:34,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 11:33:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:33:34,536 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 24 equivalence classes. [2025-03-03 11:33:34,559 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 11:33:34,559 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-03 11:33:34,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:33:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377672704] [2025-03-03 11:33:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377672704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:33:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578876208] [2025-03-03 11:33:35,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 11:33:35,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:35,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:33:35,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:33:35,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 11:33:35,776 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 24 equivalence classes. [2025-03-03 11:33:35,814 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 11:33:35,814 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2025-03-03 11:33:35,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:35,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 11:33:35,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:33:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:35,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:33:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578876208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:33:37,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:33:37,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2025-03-03 11:33:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964677919] [2025-03-03 11:33:37,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:33:37,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-03 11:33:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:33:37,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-03 11:33:37,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 11:33:37,823 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 96 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:33:37,911 INFO L93 Difference]: Finished difference Result 103 states and 150 transitions. [2025-03-03 11:33:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 11:33:37,912 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 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 51 [2025-03-03 11:33:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:33:37,913 INFO L225 Difference]: With dead ends: 103 [2025-03-03 11:33:37,913 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 11:33:37,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 11:33:37,915 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:33:37,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 11:33:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 11:33:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-03 11:33:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2025-03-03 11:33:37,926 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 51 [2025-03-03 11:33:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:33:37,927 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2025-03-03 11:33:37,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.03125) internal successors, (99), 96 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2025-03-03 11:33:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 11:33:37,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:37,930 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1] [2025-03-03 11:33:37,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 11:33:38,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:38,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:38,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:38,131 INFO L85 PathProgramCache]: Analyzing trace with hash -192027449, now seen corresponding path program 6 times [2025-03-03 11:33:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:33:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658138540] [2025-03-03 11:33:38,132 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 11:33:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:33:38,157 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 99 statements into 48 equivalence classes. [2025-03-03 11:33:38,205 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 11:33:38,206 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-03 11:33:38,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:41,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:33:41,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658138540] [2025-03-03 11:33:41,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658138540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 11:33:41,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751965966] [2025-03-03 11:33:41,503 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 11:33:41,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:41,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:33:41,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 11:33:41,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 11:33:41,593 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 99 statements into 48 equivalence classes. [2025-03-03 11:33:41,684 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 11:33:41,684 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2025-03-03 11:33:41,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:41,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-03 11:33:41,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:33:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:41,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:33:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751965966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:33:44,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 11:33:44,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2025-03-03 11:33:44,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600379898] [2025-03-03 11:33:44,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 11:33:44,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2025-03-03 11:33:44,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:33:44,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2025-03-03 11:33:44,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2025-03-03 11:33:44,665 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:33:44,742 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2025-03-03 11:33:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-03 11:33:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 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 99 [2025-03-03 11:33:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:33:44,743 INFO L225 Difference]: With dead ends: 109 [2025-03-03 11:33:44,743 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 11:33:44,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 102 SyntacticMatches, 90 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4831 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2025-03-03 11:33:44,745 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:33:44,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 11:33:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 11:33:44,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-03 11:33:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2025-03-03 11:33:44,751 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 99 [2025-03-03 11:33:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:33:44,751 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2025-03-03 11:33:44,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2025-03-03 11:33:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 11:33:44,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:44,755 INFO L218 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1] [2025-03-03 11:33:44,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 11:33:44,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 11:33:44,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:44,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:44,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1911192935, now seen corresponding path program 7 times [2025-03-03 11:33:44,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:33:44,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141128673] [2025-03-03 11:33:44,956 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 11:33:44,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:33:44,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 11:33:44,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 11:33:44,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:33:44,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:33:44,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 11:33:45,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 11:33:45,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 11:33:45,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:33:45,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 11:33:45,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 11:33:45,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 11:33:45,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 11:33:45,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 11:33:45,060 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1] [2025-03-03 11:33:45,118 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 11:33:45,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:33:45 BoogieIcfgContainer [2025-03-03 11:33:45,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 11:33:45,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 11:33:45,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 11:33:45,124 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 11:33:45,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:31" (3/4) ... [2025-03-03 11:33:45,126 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 11:33:45,127 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 11:33:45,127 INFO L158 Benchmark]: Toolchain (without parser) took 14189.94ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 104.7MB in the beginning and 175.1MB in the end (delta: -70.4MB). Peak memory consumption was 256.9MB. Max. memory is 16.1GB. [2025-03-03 11:33:45,128 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:33:45,128 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.95ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 94.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 11:33:45,129 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.14ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:33:45,129 INFO L158 Benchmark]: Boogie Preprocessor took 24.57ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:33:45,129 INFO L158 Benchmark]: IcfgBuilder took 161.45ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 81.6MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 11:33:45,129 INFO L158 Benchmark]: TraceAbstraction took 13824.68ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 81.6MB in the beginning and 175.2MB in the end (delta: -93.6MB). Peak memory consumption was 231.7MB. Max. memory is 16.1GB. [2025-03-03 11:33:45,129 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 469.8MB. Free memory was 175.2MB in the beginning and 175.1MB in the end (delta: 143.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 11:33:45,130 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.95ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 94.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.14ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 93.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.57ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 161.45ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 81.6MB in the end (delta: 10.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13824.68ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 81.6MB in the beginning and 175.2MB in the end (delta: -93.6MB). Peak memory consumption was 231.7MB. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 469.8MB. Free memory was 175.2MB in the beginning and 175.1MB in the end (delta: 143.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: 12]: 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 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 19, overapproximation of someBinaryDOUBLEComparisonOperation at line 27. Possible FailurePath: [L16] double x0, x1, x2; [L17] int i; [L19] x0 = 11. / 2. [L20] x1 = 61. / 11. [L21] i = 0 VAL [i=0] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=1, x1=114] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=2, x1=111] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=3, x1=125] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=4, x1=107] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=5, x1=198] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=6, x1=196] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=7, x1=131] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=8, x1=109] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=9, x1=140] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=10, x1=105] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=11, x1=144] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=12, x1=155] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=13, x1=157] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=14, x1=163] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=15, x1=202] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=16, x1=115] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=17, x1=180] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=18, x1=117] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=19, x1=204] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=20, x1=137] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=21, x1=175] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=22, x1=116] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=23, x1=148] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=24, x1=135] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=25, x1=200] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=26, x1=108] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=27, x1=129] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=28, x1=187] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=29, x1=176] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=30, x1=138] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=31, x1=123] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=32, x1=161] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=33, x1=142] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=34, x1=130] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=35, x1=169] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=36, x1=183] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=37, x1=199] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=38, x1=166] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=39, x1=159] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=40, x1=192] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=41, x1=171] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=42, x1=150] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=43, x1=151] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=44, x1=172] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=45, x1=133] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=46, x1=170] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=47, x1=146] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=48, x1=160] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=49, x1=195] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=50, x1=194] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=51, x1=167] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=52, x1=184] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=53, x1=139] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=54, x1=147] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=55, x1=181] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=56, x1=153] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=57, x1=143] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=58, x1=158] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=59, x1=119] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=60, x1=191] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=61, x1=121] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=62, x1=173] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=63, x1=149] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=64, x1=162] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=65, x1=201] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=66, x1=193] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=67, x1=136] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=68, x1=113] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=69, x1=110] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=70, x1=128] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=71, x1=189] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=72, x1=165] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=73, x1=106] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=74, x1=118] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=75, x1=177] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=76, x1=186] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=77, x1=122] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=78, x1=132] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=79, x1=152] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=80, x1=154] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=81, x1=179] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=82, x1=197] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=83, x1=112] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=84, x1=203] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=85, x1=127] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=86, x1=190] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=87, x1=188] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=88, x1=168] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=89, x1=126] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=90, x1=182] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=91, x1=120] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=92, x1=178] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=93, x1=205] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=94, x1=134] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=95, x1=141] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=96, x1=156] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=97, x1=185] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=98, x1=164] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=99, x1=145] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 [L21] i++ VAL [i=100, x1=124] [L21] COND FALSE !(i < 100) [L27] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) [L12] COND TRUE !(cond) [L12] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 8, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 39 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 600 GetRequests, 229 SyntacticMatches, 90 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4891 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, InterpolantAutomatonStates: 291, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 168 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 1707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1425 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/17595 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 11:33:45,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/Muller_Kahan.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 11:33:46,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 11:33:47,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 11:33:47,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 11:33:47,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 11:33:47,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 11:33:47,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 11:33:47,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 11:33:47,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 11:33:47,125 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 11:33:47,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 11:33:47,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 11:33:47,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 11:33:47,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 11:33:47,125 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 11:33:47,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 11:33:47,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 11:33:47,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 11:33:47,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 11:33:47,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 11:33:47,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 11:33:47,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 11:33:47,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 11:33:47,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 11:33:47,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 11:33:47,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:33:47,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 11:33:47,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 11:33:47,130 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2025-03-03 11:33:47,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 11:33:47,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 11:33:47,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 11:33:47,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 11:33:47,379 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 11:33:47,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2025-03-03 11:33:49,134 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4b07448/1be344a815dd40bfa61a5e711cf3cbe0/FLAGd61705cab [2025-03-03 11:33:49,336 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 11:33:49,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2025-03-03 11:33:49,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4b07448/1be344a815dd40bfa61a5e711cf3cbe0/FLAGd61705cab [2025-03-03 11:33:49,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4b07448/1be344a815dd40bfa61a5e711cf3cbe0 [2025-03-03 11:33:49,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 11:33:49,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 11:33:49,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 11:33:49,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 11:33:49,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 11:33:49,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b168d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49, skipping insertion in model container [2025-03-03 11:33:49,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 11:33:49,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2025-03-03 11:33:49,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:33:49,518 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 11:33:49,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2025-03-03 11:33:49,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 11:33:49,543 INFO L204 MainTranslator]: Completed translation [2025-03-03 11:33:49,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49 WrapperNode [2025-03-03 11:33:49,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 11:33:49,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 11:33:49,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 11:33:49,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 11:33:49,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,568 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2025-03-03 11:33:49,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 11:33:49,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 11:33:49,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 11:33:49,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 11:33:49,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,587 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-03 11:33:49,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 11:33:49,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 11:33:49,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 11:33:49,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 11:33:49,603 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (1/1) ... [2025-03-03 11:33:49,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 11:33:49,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 11:33:49,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 11:33:49,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 11:33:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 11:33:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 11:33:49,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 11:33:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 11:33:49,697 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 11:33:49,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 11:33:54,155 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 11:33:54,156 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 11:33:54,163 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 11:33:54,164 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 11:33:54,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:54 BoogieIcfgContainer [2025-03-03 11:33:54,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 11:33:54,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 11:33:54,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 11:33:54,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 11:33:54,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:33:49" (1/3) ... [2025-03-03 11:33:54,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b530ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:33:54, skipping insertion in model container [2025-03-03 11:33:54,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:33:49" (2/3) ... [2025-03-03 11:33:54,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b530ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:33:54, skipping insertion in model container [2025-03-03 11:33:54,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:33:54" (3/3) ... [2025-03-03 11:33:54,170 INFO L128 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2025-03-03 11:33:54,180 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 11:33:54,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Muller_Kahan.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 11:33:54,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 11:33:54,223 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;@72139173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 11:33:54,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 11:33:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:33:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 11:33:54,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:33:54,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 11:33:54,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:33:54,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:33:54,232 INFO L85 PathProgramCache]: Analyzing trace with hash 39093671, now seen corresponding path program 1 times [2025-03-03 11:33:54,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:33:54,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712477299] [2025-03-03 11:33:54,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:33:54,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:33:54,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:33:54,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 11:33:54,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 11:33:54,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 11:33:54,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 11:33:54,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:33:54,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:33:54,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 11:33:54,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:33:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:33:54,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 11:33:54,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:33:54,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712477299] [2025-03-03 11:33:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712477299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:33:54,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:33:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:33:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589611892] [2025-03-03 11:33:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:33:54,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:33:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:33:54,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:33:54,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:33:54,450 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03 11:33:58,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:02,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:07,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:34:07,568 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-03 11:34:07,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:34:07,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03 11:34:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:34:07,575 INFO L225 Difference]: With dead ends: 18 [2025-03-03 11:34:07,575 INFO L226 Difference]: Without dead ends: 7 [2025-03-03 11:34:07,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:34:07,579 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:34:07,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2025-03-03 11:34:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-03 11:34:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-03 11:34:07,599 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-03 11:34:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-03 11:34:07,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-03 11:34:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:34:07,604 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-03 11:34:07,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-03 11:34:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-03 11:34:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 11:34:07,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:34:07,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 11:34:07,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 11:34:07,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:34:07,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:34:07,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:34:07,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1211935550, now seen corresponding path program 1 times [2025-03-03 11:34:07,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 11:34:07,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156116946] [2025-03-03 11:34:07,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:34:07,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 11:34:07,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 11:34:07,809 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 11:34:07,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 11:34:07,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 11:34:09,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 11:34:09,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:34:09,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:34:09,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 11:34:09,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 11:34:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:34:09,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 11:34:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 11:34:09,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 11:34:09,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156116946] [2025-03-03 11:34:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156116946] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 11:34:09,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 11:34:09,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-03 11:34:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9328965] [2025-03-03 11:34:09,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 11:34:09,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 11:34:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 11:34:09,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 11:34:09,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 11:34:09,730 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-03 11:34:14,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:18,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:22,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:26,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:30,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:34,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:38,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:42,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:46,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:50,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:54,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:34:58,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:35:02,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:35:06,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 11:35:11,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []