./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i --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/hardness-nfm22/hardness_codestructure_normal_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:52:22,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:52:22,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:52:22,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:52:22,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:52:22,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:52:22,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:52:22,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:52:22,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:52:22,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:52:22,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:52:22,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:52:22,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:52:22,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:52:22,991 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:52:22,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:52:22,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:52:22,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:52:22,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:52:22,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:52:22,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:52:22,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:52:22,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:52:22,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:52:22,993 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:52:22,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:52:22,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:52:22,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:52:22,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:52:22,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:52:22,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:52:22,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:52:22,994 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 -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2025-03-03 18:52:23,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:52:23,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:52:23,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:52:23,190 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:52:23,190 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:52:23,191 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-03 18:52:24,328 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2765c74/adb7cfcafeb346dc8a4934ee1cfa1d39/FLAG92e3ff08d [2025-03-03 18:52:24,560 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:52:24,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-03 18:52:24,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2765c74/adb7cfcafeb346dc8a4934ee1cfa1d39/FLAG92e3ff08d [2025-03-03 18:52:24,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2765c74/adb7cfcafeb346dc8a4934ee1cfa1d39 [2025-03-03 18:52:24,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:52:24,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:52:24,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:52:24,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:52:24,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:52:24,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:52:24" (1/1) ... [2025-03-03 18:52:24,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:24, skipping insertion in model container [2025-03-03 18:52:24,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:52:24" (1/1) ... [2025-03-03 18:52:24,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:52:25,002 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/hardness-nfm22/hardness_codestructure_normal_file-59.i[913,926] [2025-03-03 18:52:25,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:52:25,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:52:25,081 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/hardness-nfm22/hardness_codestructure_normal_file-59.i[913,926] [2025-03-03 18:52:25,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:52:25,125 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:52:25,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25 WrapperNode [2025-03-03 18:52:25,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:52:25,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:52:25,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:52:25,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:52:25,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,166 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-03 18:52:25,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:52:25,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:52:25,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:52:25,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:52:25,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,195 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 18:52:25,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:52:25,216 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:52:25,216 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:52:25,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:52:25,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (1/1) ... [2025-03-03 18:52:25,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:52:25,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:52:25,244 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 18:52:25,247 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 18:52:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:52:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:52:25,266 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:52:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:52:25,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:52:25,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:52:25,322 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:52:25,323 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:52:25,647 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:52:25,647 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:52:25,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:52:25,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:52:25,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:25 BoogieIcfgContainer [2025-03-03 18:52:25,659 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:52:25,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:52:25,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:52:25,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:52:25,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:52:24" (1/3) ... [2025-03-03 18:52:25,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52103410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:52:25, skipping insertion in model container [2025-03-03 18:52:25,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:25" (2/3) ... [2025-03-03 18:52:25,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52103410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:52:25, skipping insertion in model container [2025-03-03 18:52:25,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:25" (3/3) ... [2025-03-03 18:52:25,668 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2025-03-03 18:52:25,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:52:25,681 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-59.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:52:25,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:52:25,736 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;@7606da51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:52:25,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:52:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:52:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 18:52:25,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:25,750 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:25,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -325798736, now seen corresponding path program 1 times [2025-03-03 18:52:25,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:52:25,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201259347] [2025-03-03 18:52:25,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:52:25,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 18:52:25,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 18:52:25,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:25,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 18:52:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:52:26,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201259347] [2025-03-03 18:52:26,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201259347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:52:26,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936957634] [2025-03-03 18:52:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:26,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:52:26,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:52:26,011 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 18:52:26,025 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 18:52:26,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 18:52:26,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 18:52:26,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:26,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:26,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:52:26,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:52:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 18:52:26,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:52:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936957634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:52:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:52:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:52:26,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36388092] [2025-03-03 18:52:26,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:52:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:52:26,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:52:26,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:52:26,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:52:26,190 INFO L87 Difference]: Start difference. First operand has 60 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 18:52:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:52:26,206 INFO L93 Difference]: Finished difference Result 114 states and 197 transitions. [2025-03-03 18:52:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:52:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2025-03-03 18:52:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:52:26,212 INFO L225 Difference]: With dead ends: 114 [2025-03-03 18:52:26,212 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 18:52:26,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:52:26,216 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:52:26,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:52:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 18:52:26,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 18:52:26,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:52:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-03 18:52:26,247 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2025-03-03 18:52:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:52:26,247 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-03 18:52:26,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 18:52:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-03 18:52:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 18:52:26,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:26,251 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:26,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:52:26,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:52:26,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:26,453 INFO L85 PathProgramCache]: Analyzing trace with hash -438648818, now seen corresponding path program 1 times [2025-03-03 18:52:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:52:26,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645539102] [2025-03-03 18:52:26,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:52:26,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 18:52:26,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 18:52:26,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:26,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 18:52:26,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:52:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645539102] [2025-03-03 18:52:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645539102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:52:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:52:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:52:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285751699] [2025-03-03 18:52:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:52:26,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:52:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:52:26,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:52:26,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:52:26,828 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:52:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:52:26,889 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2025-03-03 18:52:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:52:26,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2025-03-03 18:52:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:52:26,891 INFO L225 Difference]: With dead ends: 134 [2025-03-03 18:52:26,891 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 18:52:26,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 18:52:26,892 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:52:26,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 159 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:52:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 18:52:26,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2025-03-03 18:52:26,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:52:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2025-03-03 18:52:26,908 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 126 [2025-03-03 18:52:26,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:52:26,909 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2025-03-03 18:52:26,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:52:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2025-03-03 18:52:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:52:26,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:26,910 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:26,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:52:26,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:26,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:26,910 INFO L85 PathProgramCache]: Analyzing trace with hash -469212393, now seen corresponding path program 1 times [2025-03-03 18:52:26,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:52:26,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508283789] [2025-03-03 18:52:26,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:26,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:52:26,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:52:27,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:52:27,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:27,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:52:27,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239366610] [2025-03-03 18:52:27,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:27,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:52:27,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:52:27,025 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 18:52:27,026 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 18:52:27,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:52:27,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:52:27,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:27,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:27,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 18:52:27,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:52:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-03 18:52:28,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:52:29,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:52:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508283789] [2025-03-03 18:52:29,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 18:52:29,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239366610] [2025-03-03 18:52:29,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239366610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:52:29,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:52:29,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-03 18:52:29,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503260483] [2025-03-03 18:52:29,127 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 18:52:29,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 18:52:29,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:52:29,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 18:52:29,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-03 18:52:29,132 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-03 18:52:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:52:29,931 INFO L93 Difference]: Finished difference Result 221 states and 304 transitions. [2025-03-03 18:52:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 18:52:29,932 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 127 [2025-03-03 18:52:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:52:29,934 INFO L225 Difference]: With dead ends: 221 [2025-03-03 18:52:29,934 INFO L226 Difference]: Without dead ends: 147 [2025-03-03 18:52:29,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=266, Invalid=664, Unknown=0, NotChecked=0, Total=930 [2025-03-03 18:52:29,936 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 143 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:52:29,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 328 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:52:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-03 18:52:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 98. [2025-03-03 18:52:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 70 states have internal predecessors, (88), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:52:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2025-03-03 18:52:29,948 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 127 [2025-03-03 18:52:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:52:29,948 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2025-03-03 18:52:29,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 5 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-03 18:52:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2025-03-03 18:52:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:52:29,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:29,950 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:29,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 18:52:30,155 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 18:52:30,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2018300440, now seen corresponding path program 1 times [2025-03-03 18:52:30,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:52:30,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248460432] [2025-03-03 18:52:30,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:30,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:52:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:52:30,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:52:30,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:30,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 18:52:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:52:30,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248460432] [2025-03-03 18:52:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248460432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:52:30,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:52:30,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:52:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309341872] [2025-03-03 18:52:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:52:30,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:52:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:52:30,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:52:30,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:52:30,219 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:52:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:52:30,245 INFO L93 Difference]: Finished difference Result 195 states and 258 transitions. [2025-03-03 18:52:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:52:30,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2025-03-03 18:52:30,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:52:30,246 INFO L225 Difference]: With dead ends: 195 [2025-03-03 18:52:30,246 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 18:52:30,247 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 18:52:30,247 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:52:30,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 162 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:52:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 18:52:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2025-03-03 18:52:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:52:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2025-03-03 18:52:30,263 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 127 [2025-03-03 18:52:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:52:30,264 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2025-03-03 18:52:30,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:52:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2025-03-03 18:52:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 18:52:30,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:30,268 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:52:30,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:30,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:30,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1886749615, now seen corresponding path program 1 times [2025-03-03 18:52:30,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:52:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794924093] [2025-03-03 18:52:30,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:52:30,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 18:52:30,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 18:52:30,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:52:30,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2045634163] [2025-03-03 18:52:30,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:30,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:52:30,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:52:30,332 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 18:52:30,334 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 18:52:30,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 18:52:30,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 18:52:30,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:30,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:52:30,449 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:52:30,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 18:52:30,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 18:52:30,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:30,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:52:30,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:52:30,540 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:52:30,541 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:52:30,549 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 18:52:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:52:30,745 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 18:52:30,795 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:52:30,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:52:30 BoogieIcfgContainer [2025-03-03 18:52:30,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:52:30,801 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:52:30,801 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:52:30,801 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:52:30,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:25" (3/4) ... [2025-03-03 18:52:30,804 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:52:30,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:52:30,806 INFO L158 Benchmark]: Toolchain (without parser) took 5922.17ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 103.9MB in the beginning and 143.6MB in the end (delta: -39.7MB). Peak memory consumption was 119.7MB. Max. memory is 16.1GB. [2025-03-03 18:52:30,806 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory was 127.4MB in the beginning and 127.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:52:30,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.87ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 90.5MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:52:30,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.91ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 86.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:52:30,806 INFO L158 Benchmark]: Boogie Preprocessor took 47.94ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 80.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:52:30,806 INFO L158 Benchmark]: IcfgBuilder took 443.13ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 58.1MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 18:52:30,807 INFO L158 Benchmark]: TraceAbstraction took 5139.04ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 57.0MB in the beginning and 145.0MB in the end (delta: -88.0MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-03-03 18:52:30,807 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 302.0MB. Free memory was 145.0MB in the beginning and 143.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:52:30,808 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.15ms. Allocated memory is still 201.3MB. Free memory was 127.4MB in the beginning and 127.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.87ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 90.5MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.91ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 86.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.94ms. Allocated memory is still 142.6MB. Free memory was 86.0MB in the beginning and 80.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 443.13ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 58.1MB in the end (delta: 22.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5139.04ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 57.0MB in the beginning and 145.0MB in the end (delta: -88.0MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 302.0MB. Free memory was 145.0MB in the beginning and 143.6MB in the end (delta: 1.4MB). 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 25; [L26] unsigned short int var_1_5 = 0; [L27] unsigned short int var_1_6 = 62100; [L28] unsigned short int var_1_7 = 27651; [L29] double var_1_8 = 128.9; [L30] unsigned char var_1_9 = 1; [L31] double var_1_10 = 16.5; [L32] double var_1_11 = 25.5; [L33] double var_1_12 = 199.75; [L34] unsigned char var_1_13 = 2; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 1; [L38] unsigned short int var_1_17 = 32; [L39] unsigned char var_1_18 = 1; [L40] unsigned long int var_1_19 = 1; VAL [isInitial=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] FCALL updateLastVariables() [L135] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L94] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_3=100, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L97] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L100] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L101] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L102] var_1_6 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L103] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L104] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=27651, var_1_8=1289/10, var_1_9=1] [L105] var_1_7 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L106] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L107] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10] [L109] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L112] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L113] var_1_11 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L114] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L115] var_1_12 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L116] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L119] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L121] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_2=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L135] RET updateVariables() [L136] CALL step() [L44] COND FALSE !((var_1_3 != (16 / var_1_4)) && var_1_2) [L55] var_1_1 = var_1_3 VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L57] COND FALSE !(var_1_1 < var_1_3) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=0, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L60] COND TRUE ! var_1_2 [L61] var_1_5 = ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=1289/10, var_1_9=1] [L64] COND FALSE !(\read(var_1_2)) [L71] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L73] COND TRUE var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5)))) VAL [isInitial=1, var_1_11=2, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L74] COND TRUE var_1_3 <= var_1_6 [L75] var_1_13 = 32 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L82] COND TRUE var_1_12 != var_1_8 [L83] var_1_15 = (! var_1_16) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L87] var_1_17 = var_1_4 [L88] var_1_18 = var_1_16 [L89] var_1_19 = var_1_4 VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=16, var_1_18=1, var_1_19=16, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L136] RET step() [L137] CALL, EXPR property() [L127-L128] return (((((((((var_1_3 != (16 / var_1_4)) && var_1_2) ? ((var_1_3 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_3))) : (var_1_2 ? (var_1_1 == ((unsigned short int) var_1_3)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_3))) && ((var_1_1 < var_1_3) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - var_1_3)))) : ((! var_1_2) ? (var_1_5 == ((unsigned short int) ((((var_1_3) > ((var_1_7 + var_1_4))) ? (var_1_3) : ((var_1_7 + var_1_4)))))) : 1))) && (var_1_2 ? (((! var_1_9) || (var_1_5 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_3 != ((var_1_6 / var_1_4) * ((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))))) ? ((var_1_3 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=16, var_1_18=1, var_1_19=16, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=16, var_1_18=1, var_1_19=16, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=16, var_1_18=1, var_1_19=16, var_1_1=0, var_1_2=0, var_1_3=0, var_1_4=16, var_1_5=16399, var_1_6=32767, var_1_7=-49153, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 197 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 398 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 539 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 337 mSDtfsCounter, 539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 66 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1015 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 627 ConstructedInterpolants, 0 QuantifiedInterpolants, 2142 SizeOfPredicates, 6 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 3648/3800 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 18:52:30,824 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/hardness-nfm22/hardness_codestructure_normal_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:52:32,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:52:32,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:52:32,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:52:32,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:52:32,703 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:52:32,704 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:52:32,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:52:32,705 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:52:32,705 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:52:32,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:52:32,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:52:32,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:52:32,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:52:32,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:52:32,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:52:32,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:52:32,708 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:52:32,709 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:52:32,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:52:32,709 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:52:32,709 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:52:32,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:52:32,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:52:32,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:52:32,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:52:32,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:52:32,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:52:32,710 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 -> e093e3889d1250dd6c4e72475f92fd634899e4114caa675b33a0cb0284b4d442 [2025-03-03 18:52:32,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:52:32,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:52:32,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:52:32,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:52:32,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:52:32,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-03 18:52:34,084 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04c96ae3/4a8a660fecd04590b7b4588114a31524/FLAG889e73495 [2025-03-03 18:52:34,305 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:52:34,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-59.i [2025-03-03 18:52:34,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04c96ae3/4a8a660fecd04590b7b4588114a31524/FLAG889e73495 [2025-03-03 18:52:34,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04c96ae3/4a8a660fecd04590b7b4588114a31524 [2025-03-03 18:52:34,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:52:34,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:52:34,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:52:34,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:52:34,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:52:34,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4958c96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34, skipping insertion in model container [2025-03-03 18:52:34,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:52:34,766 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/hardness-nfm22/hardness_codestructure_normal_file-59.i[913,926] [2025-03-03 18:52:34,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:52:34,814 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:52:34,822 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/hardness-nfm22/hardness_codestructure_normal_file-59.i[913,926] [2025-03-03 18:52:34,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:52:34,850 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:52:34,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34 WrapperNode [2025-03-03 18:52:34,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:52:34,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:52:34,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:52:34,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:52:34,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,877 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-03 18:52:34,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:52:34,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:52:34,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:52:34,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:52:34,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,887 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,896 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 18:52:34,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:52:34,907 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:52:34,907 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:52:34,907 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:52:34,908 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (1/1) ... [2025-03-03 18:52:34,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:52:34,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:52:34,939 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 18:52:34,942 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 18:52:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:52:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 18:52:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:52:34,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:52:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:52:34,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:52:35,025 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:52:35,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:52:35,578 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:52:35,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:52:35,585 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:52:35,585 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:52:35,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:35 BoogieIcfgContainer [2025-03-03 18:52:35,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:52:35,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:52:35,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:52:35,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:52:35,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:52:34" (1/3) ... [2025-03-03 18:52:35,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4755e1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:52:35, skipping insertion in model container [2025-03-03 18:52:35,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:52:34" (2/3) ... [2025-03-03 18:52:35,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4755e1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:52:35, skipping insertion in model container [2025-03-03 18:52:35,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:52:35" (3/3) ... [2025-03-03 18:52:35,593 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-59.i [2025-03-03 18:52:35,603 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:52:35,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-59.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:52:35,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:52:35,654 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;@bd5828a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:52:35,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:52:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:52:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 18:52:35,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:35,664 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:35,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:35,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:35,668 INFO L85 PathProgramCache]: Analyzing trace with hash -325798736, now seen corresponding path program 1 times [2025-03-03 18:52:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:52:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384562155] [2025-03-03 18:52:35,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:35,676 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 18:52:35,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:52:35,678 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 18:52:35,680 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 18:52:35,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 18:52:35,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 18:52:35,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:35,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:35,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:52:35,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:52:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-03 18:52:35,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:52:35,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:52:35,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384562155] [2025-03-03 18:52:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384562155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:52:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:52:35,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 18:52:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655375240] [2025-03-03 18:52:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:52:35,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:52:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:52:35,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:52:35,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:52:35,951 INFO L87 Difference]: Start difference. First operand has 60 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 18:52:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:52:35,972 INFO L93 Difference]: Finished difference Result 114 states and 197 transitions. [2025-03-03 18:52:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:52:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2025-03-03 18:52:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:52:35,980 INFO L225 Difference]: With dead ends: 114 [2025-03-03 18:52:35,980 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 18:52:35,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:52:35,985 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:52:35,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:52:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 18:52:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-03 18:52:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 18:52:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-03 18:52:36,021 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2025-03-03 18:52:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:52:36,021 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-03 18:52:36,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 18:52:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-03 18:52:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 18:52:36,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:36,027 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:36,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:52:36,228 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 18:52:36,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:36,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash -438648818, now seen corresponding path program 1 times [2025-03-03 18:52:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:52:36,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407782946] [2025-03-03 18:52:36,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:36,230 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 18:52:36,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:52:36,232 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 18:52:36,233 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 18:52:36,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 18:52:36,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 18:52:36,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:36,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:36,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 18:52:36,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:52:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 18:52:36,480 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:52:36,480 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:52:36,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407782946] [2025-03-03 18:52:36,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407782946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:52:36,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:52:36,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:52:36,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501296320] [2025-03-03 18:52:36,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:52:36,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:52:36,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:52:36,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:52:36,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:52:36,482 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:52:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:52:36,842 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2025-03-03 18:52:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:52:36,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2025-03-03 18:52:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:52:36,845 INFO L225 Difference]: With dead ends: 134 [2025-03-03 18:52:36,846 INFO L226 Difference]: Without dead ends: 80 [2025-03-03 18:52:36,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 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 18:52:36,847 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 29 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:52:36,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 174 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:52:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-03 18:52:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2025-03-03 18:52:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 53 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:52:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2025-03-03 18:52:36,866 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 126 [2025-03-03 18:52:36,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:52:36,867 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2025-03-03 18:52:36,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:52:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2025-03-03 18:52:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:52:36,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:36,868 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:36,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 18:52:37,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:52:37,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:37,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:37,070 INFO L85 PathProgramCache]: Analyzing trace with hash -655222794, now seen corresponding path program 1 times [2025-03-03 18:52:37,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:52:37,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654481588] [2025-03-03 18:52:37,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:37,071 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 18:52:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:52:37,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:52:37,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 18:52:37,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:52:37,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:52:37,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:37,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:37,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 18:52:37,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:52:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 18:52:37,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:52:37,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:52:37,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654481588] [2025-03-03 18:52:37,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654481588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:52:37,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:52:37,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 18:52:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298477334] [2025-03-03 18:52:37,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:52:37,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 18:52:37,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 18:52:37,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 18:52:37,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 18:52:37,275 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:52:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:52:37,662 INFO L93 Difference]: Finished difference Result 168 states and 247 transitions. [2025-03-03 18:52:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 18:52:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2025-03-03 18:52:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:52:37,667 INFO L225 Difference]: With dead ends: 168 [2025-03-03 18:52:37,667 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 18:52:37,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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 18:52:37,668 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:52:37,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 166 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:52:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 18:52:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2025-03-03 18:52:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-03 18:52:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-03-03 18:52:37,694 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 127 [2025-03-03 18:52:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:52:37,695 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-03-03 18:52:37,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 18:52:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-03-03 18:52:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 18:52:37,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:52:37,697 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:52:37,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 18:52:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 18:52:37,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:52:37,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:52:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash -469212393, now seen corresponding path program 1 times [2025-03-03 18:52:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 18:52:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510453893] [2025-03-03 18:52:37,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:52:37,899 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 18:52:37,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 18:52:37,901 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 18:52:37,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 18:52:37,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:52:38,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:52:38,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:52:38,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:52:38,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 18:52:38,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:52:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 435 proven. 114 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2025-03-03 18:52:39,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:53:01,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 18:53:01,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510453893] [2025-03-03 18:53:01,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510453893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:53:01,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [773331216] [2025-03-03 18:53:01,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:53:01,100 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 18:53:01,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 18:53:01,102 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 18:53:01,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 18:53:01,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 18:53:02,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 18:53:02,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:53:02,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:53:02,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 18:53:02,020 INFO L279 TraceCheckSpWp]: Computing forward predicates...