./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.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_variablewrapping_normal_file-6.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 65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:56:40,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:56:40,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:56:40,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:56:40,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:56:40,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:56:40,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:56:40,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:56:40,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:56:40,927 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:56:40,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:56:40,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:56:40,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:56:40,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:56:40,929 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:56:40,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:56:40,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:56:40,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:56:40,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:56:40,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:56:40,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:56:40,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:56:40,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:56:40,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:56:40,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:56:40,932 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 -> 65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7 [2025-03-04 00:56:41,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:56:41,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:56:41,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:56:41,172 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:56:41,173 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:56:41,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i [2025-03-04 00:56:42,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eb72203/35484a206fae494ba800bfc6ef8a5eb3/FLAG15915407f [2025-03-04 00:56:42,530 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:56:42,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i [2025-03-04 00:56:42,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eb72203/35484a206fae494ba800bfc6ef8a5eb3/FLAG15915407f [2025-03-04 00:56:42,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0eb72203/35484a206fae494ba800bfc6ef8a5eb3 [2025-03-04 00:56:42,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:56:42,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:56:42,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:56:42,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:56:42,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:56:42,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:56:42" (1/1) ... [2025-03-04 00:56:42,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:42, skipping insertion in model container [2025-03-04 00:56:42,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:56:42" (1/1) ... [2025-03-04 00:56:42,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:56:42,993 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_variablewrapping_normal_file-6.i[912,925] [2025-03-04 00:56:43,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:56:43,051 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:56:43,061 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i[912,925] [2025-03-04 00:56:43,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:56:43,101 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:56:43,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43 WrapperNode [2025-03-04 00:56:43,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:56:43,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:56:43,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:56:43,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:56:43,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,139 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-04 00:56:43,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:56:43,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:56:43,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:56:43,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:56:43,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,175 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-04 00:56:43,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:56:43,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:56:43,189 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:56:43,189 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:56:43,190 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (1/1) ... [2025-03-04 00:56:43,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:56:43,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:56:43,215 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-04 00:56:43,219 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-04 00:56:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:56:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:56:43,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:56:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:56:43,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:56:43,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:56:43,277 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:56:43,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:56:43,460 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:56:43,460 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:56:43,467 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:56:43,467 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:56:43,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:43 BoogieIcfgContainer [2025-03-04 00:56:43,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:56:43,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:56:43,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:56:43,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:56:43,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:56:42" (1/3) ... [2025-03-04 00:56:43,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e12ed32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:43, skipping insertion in model container [2025-03-04 00:56:43,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:43" (2/3) ... [2025-03-04 00:56:43,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e12ed32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:43, skipping insertion in model container [2025-03-04 00:56:43,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:43" (3/3) ... [2025-03-04 00:56:43,474 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-6.i [2025-03-04 00:56:43,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:56:43,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-6.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:56:43,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:56:43,537 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;@1e8ac4d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:56:43,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:56:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:56:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:56:43,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:43,554 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:43,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:43,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash 332193008, now seen corresponding path program 1 times [2025-03-04 00:56:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814147454] [2025-03-04 00:56:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:43,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:56:43,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:56:43,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:43,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:56:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:56:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814147454] [2025-03-04 00:56:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814147454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:56:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859435569] [2025-03-04 00:56:43,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:43,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:56:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:56:43,808 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-04 00:56:43,810 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-04 00:56:43,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:56:43,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:56:43,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:43,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:43,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:56:43,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-04 00:56:43,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:56:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859435569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:43,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:56:43,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:56:43,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836830577] [2025-03-04 00:56:43,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:43,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:56:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:56:43,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:56:43,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:56:43,996 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:56:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:44,012 INFO L93 Difference]: Finished difference Result 104 states and 176 transitions. [2025-03-04 00:56:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:56:44,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2025-03-04 00:56:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:44,020 INFO L225 Difference]: With dead ends: 104 [2025-03-04 00:56:44,020 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:56:44,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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-04 00:56:44,026 INFO L435 NwaCegarLoop]: 76 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, 76 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-04 00:56:44,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:56:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:56:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:56:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:56:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2025-03-04 00:56:44,058 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 120 [2025-03-04 00:56:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:44,058 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2025-03-04 00:56:44,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:56:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2025-03-04 00:56:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:56:44,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:44,061 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:44,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:56:44,261 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-04 00:56:44,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:44,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash -161895659, now seen corresponding path program 1 times [2025-03-04 00:56:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:44,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791620718] [2025-03-04 00:56:44,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:44,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:56:44,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:56:44,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:44,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:56:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:56:44,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791620718] [2025-03-04 00:56:44,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791620718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:44,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:44,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:56:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035962910] [2025-03-04 00:56:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:44,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:56:44,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:56:44,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:56:44,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:56:44,707 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:56:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:44,810 INFO L93 Difference]: Finished difference Result 101 states and 149 transitions. [2025-03-04 00:56:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:56:44,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2025-03-04 00:56:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:44,813 INFO L225 Difference]: With dead ends: 101 [2025-03-04 00:56:44,813 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:56:44,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:56:44,815 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:56:44,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:56:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:56:44,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:56:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:56:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-04 00:56:44,822 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 120 [2025-03-04 00:56:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:44,823 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-04 00:56:44,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:56:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-03-04 00:56:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:56:44,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:44,824 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:44,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:56:44,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:44,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 725608022, now seen corresponding path program 1 times [2025-03-04 00:56:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150047741] [2025-03-04 00:56:44,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:44,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:56:44,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:56:44,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:44,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:56:45,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:56:45,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150047741] [2025-03-04 00:56:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150047741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:45,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:56:45,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630239890] [2025-03-04 00:56:45,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:45,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:56:45,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:56:45,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:56:45,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:56:45,025 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:56:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:45,053 INFO L93 Difference]: Finished difference Result 136 states and 195 transitions. [2025-03-04 00:56:45,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:56:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2025-03-04 00:56:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:45,056 INFO L225 Difference]: With dead ends: 136 [2025-03-04 00:56:45,056 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 00:56:45,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-04 00:56:45,057 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:56:45,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 173 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:56:45,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 00:56:45,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-04 00:56:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 00:56:45,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-04 00:56:45,074 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 120 [2025-03-04 00:56:45,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:45,074 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-04 00:56:45,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:56:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-04 00:56:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:56:45,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:45,076 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:45,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:56:45,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:45,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:45,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1826548939, now seen corresponding path program 1 times [2025-03-04 00:56:45,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:45,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163692536] [2025-03-04 00:56:45,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:45,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:56:45,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:56:45,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:45,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:56:50,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:56:50,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163692536] [2025-03-04 00:56:50,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163692536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:50,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:50,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:56:50,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786698045] [2025-03-04 00:56:50,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:50,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:56:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:56:50,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:56:50,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:56:50,416 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:56:55,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:55,051 INFO L93 Difference]: Finished difference Result 175 states and 246 transitions. [2025-03-04 00:56:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:56:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2025-03-04 00:56:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:55,056 INFO L225 Difference]: With dead ends: 175 [2025-03-04 00:56:55,057 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 00:56:55,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:56:55,058 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:56:55,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 339 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:56:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 00:56:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2025-03-04 00:56:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 101 states have (on average 1.1782178217821782) internal successors, (119), 103 states have internal predecessors, (119), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-04 00:56:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2025-03-04 00:56:55,088 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 120 [2025-03-04 00:56:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:55,089 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2025-03-04 00:56:55,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:56:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2025-03-04 00:56:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:56:55,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:55,092 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:55,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:56:55,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:55,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -816086350, now seen corresponding path program 1 times [2025-03-04 00:56:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:55,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493774850] [2025-03-04 00:56:55,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:55,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:56:55,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:56:55,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:55,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:56:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:56:55,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493774850] [2025-03-04 00:56:55,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493774850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:55,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:55,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:56:55,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999798975] [2025-03-04 00:56:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:55,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:56:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:56:55,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:56:55,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:56:55,457 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:56:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:55,663 INFO L93 Difference]: Finished difference Result 393 states and 565 transitions. [2025-03-04 00:56:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:56:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2025-03-04 00:56:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:55,667 INFO L225 Difference]: With dead ends: 393 [2025-03-04 00:56:55,669 INFO L226 Difference]: Without dead ends: 230 [2025-03-04 00:56:55,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:56:55,672 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 42 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:56:55,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 216 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:56:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-04 00:56:55,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 214. [2025-03-04 00:56:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 129 states have (on average 1.178294573643411) internal successors, (152), 131 states have internal predecessors, (152), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 00:56:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 310 transitions. [2025-03-04 00:56:55,711 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 310 transitions. Word has length 121 [2025-03-04 00:56:55,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:55,712 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 310 transitions. [2025-03-04 00:56:55,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:56:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2025-03-04 00:56:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:56:55,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:55,713 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:56:55,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:56:55,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:55,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash -815162829, now seen corresponding path program 1 times [2025-03-04 00:56:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:56:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-03-04 00:56:55,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:56:55,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:56:55,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:56:55,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:55,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:56:59,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:56:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122397617] [2025-03-04 00:56:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122397617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:59,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:59,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 00:56:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553357204] [2025-03-04 00:56:59,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:59,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:56:59,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:56:59,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:56:59,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:56:59,947 INFO L87 Difference]: Start difference. First operand 214 states and 310 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:04,635 INFO L93 Difference]: Finished difference Result 233 states and 329 transitions. [2025-03-04 00:57:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:57:04,636 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2025-03-04 00:57:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:04,639 INFO L225 Difference]: With dead ends: 233 [2025-03-04 00:57:04,639 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 00:57:04,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:57:04,640 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 78 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:04,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 409 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:57:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 00:57:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 214. [2025-03-04 00:57:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 129 states have (on average 1.178294573643411) internal successors, (152), 131 states have internal predecessors, (152), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 00:57:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 310 transitions. [2025-03-04 00:57:04,670 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 310 transitions. Word has length 121 [2025-03-04 00:57:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:04,672 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 310 transitions. [2025-03-04 00:57:04,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2025-03-04 00:57:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:57:04,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:04,673 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:57:04,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:57:04,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:04,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash 757792244, now seen corresponding path program 1 times [2025-03-04 00:57:04,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:04,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-03-04 00:57:04,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:04,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:04,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:57:04,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:57:04,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:04,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:57:06,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:57:06,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169925182] [2025-03-04 00:57:06,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169925182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:06,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:06,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:57:06,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175278297] [2025-03-04 00:57:06,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:06,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:57:06,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:57:06,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:57:06,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:57:06,035 INFO L87 Difference]: Start difference. First operand 214 states and 310 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:06,453 INFO L93 Difference]: Finished difference Result 261 states and 367 transitions. [2025-03-04 00:57:06,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:57:06,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2025-03-04 00:57:06,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:06,455 INFO L225 Difference]: With dead ends: 261 [2025-03-04 00:57:06,455 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 00:57:06,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:57:06,456 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 66 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:06,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 354 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:57:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 00:57:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 223. [2025-03-04 00:57:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 138 states have (on average 1.1956521739130435) internal successors, (165), 140 states have internal predecessors, (165), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 00:57:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 323 transitions. [2025-03-04 00:57:06,478 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 323 transitions. Word has length 121 [2025-03-04 00:57:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:06,479 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 323 transitions. [2025-03-04 00:57:06,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 323 transitions. [2025-03-04 00:57:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:57:06,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:06,480 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:57:06,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:57:06,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:06,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1794364717, now seen corresponding path program 1 times [2025-03-04 00:57:06,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:06,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78496396] [2025-03-04 00:57:06,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:06,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:06,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:57:06,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:57:06,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:06,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:57:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:57:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78496396] [2025-03-04 00:57:09,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78496396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:09,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:09,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:57:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962454787] [2025-03-04 00:57:09,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:09,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:57:09,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:57:09,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:57:09,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:57:09,264 INFO L87 Difference]: Start difference. First operand 223 states and 323 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:10,290 INFO L93 Difference]: Finished difference Result 249 states and 350 transitions. [2025-03-04 00:57:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:57:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2025-03-04 00:57:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:10,293 INFO L225 Difference]: With dead ends: 249 [2025-03-04 00:57:10,293 INFO L226 Difference]: Without dead ends: 247 [2025-03-04 00:57:10,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:57:10,294 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 111 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:10,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 356 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:57:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-04 00:57:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 232. [2025-03-04 00:57:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 147 states have (on average 1.1972789115646258) internal successors, (176), 149 states have internal predecessors, (176), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2025-03-04 00:57:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2025-03-04 00:57:10,330 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 121 [2025-03-04 00:57:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:10,330 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2025-03-04 00:57:10,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2025-03-04 00:57:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 00:57:10,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:10,331 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:57:10,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:57:10,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:10,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1049662219, now seen corresponding path program 1 times [2025-03-04 00:57:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108904322] [2025-03-04 00:57:10,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:10,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:10,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:57:10,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:57:10,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:10,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:57:10,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235247854] [2025-03-04 00:57:10,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:57:10,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:10,390 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-04 00:57:10,392 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-04 00:57:10,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:57:10,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:57:10,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:10,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:57:10,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:57:10,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 00:57:10,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 00:57:10,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:10,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:57:10,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:57:10,697 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:57:10,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:57:10,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:57:10,903 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,SelfDestructingSolverStorable8 [2025-03-04 00:57:10,906 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:57:10,967 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:57:10,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:57:10 BoogieIcfgContainer [2025-03-04 00:57:10,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:57:10,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:57:10,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:57:10,975 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:57:10,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:43" (3/4) ... [2025-03-04 00:57:10,977 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:57:10,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:57:10,978 INFO L158 Benchmark]: Toolchain (without parser) took 28100.88ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 104.4MB in the beginning and 374.4MB in the end (delta: -270.1MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2025-03-04 00:57:10,978 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 125.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:10,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.13ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 91.7MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:57:10,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.63ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:10,978 INFO L158 Benchmark]: Boogie Preprocessor took 43.64ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:10,979 INFO L158 Benchmark]: IcfgBuilder took 279.35ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 68.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:57:10,979 INFO L158 Benchmark]: TraceAbstraction took 27504.33ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 67.8MB in the beginning and 374.6MB in the end (delta: -306.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-03-04 00:57:10,979 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 469.8MB. Free memory was 374.6MB in the beginning and 374.4MB in the end (delta: 147.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:57:10,980 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 125.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.13ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 91.7MB in the end (delta: 12.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.63ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.64ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 279.35ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 68.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27504.33ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 67.8MB in the beginning and 374.6MB in the end (delta: -306.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 469.8MB. Free memory was 374.6MB in the beginning and 374.4MB in the end (delta: 147.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] unsigned short int var_1_4 = 32; [L24] unsigned short int var_1_6 = 10; [L25] signed long int var_1_7 = 4; [L26] signed long int var_1_8 = 2; [L27] double var_1_9 = 0.0; [L28] double var_1_10 = 64.2; [L29] double var_1_11 = 0.0; [L30] double var_1_12 = 0.25; [L31] unsigned short int var_1_13 = 36833; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] signed long int var_1_18 = -32; [L36] unsigned long int var_1_20 = 50; [L37] unsigned long int var_1_21 = 2655070710; [L38] unsigned char last_1_var_1_14 = 0; [L39] signed long int last_1_var_1_18 = -32; [L40] unsigned long int last_1_var_1_20 = 50; VAL [isInitial=0, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=32, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L101] last_1_var_1_14 = var_1_14 [L102] last_1_var_1_18 = var_1_18 [L103] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=32, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L72] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=4, var_1_8=2, var_1_9=0] [L73] var_1_7 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L74] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_7 <= 17) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 <= 17) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=2, var_1_9=0] [L76] var_1_8 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_8 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0, var_1_9=0] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L80] RET assume_abort_if_not((var_1_9 >= 4611686.018427387900e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_10=321/5, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427387900e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_11=0, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_12=1/4, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L85] var_1_12 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=36833, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L87] var_1_13 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_13 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L88] RET assume_abort_if_not(var_1_13 >= 32767) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L89] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L89] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=0, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L91] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L92] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=0, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L93] var_1_17 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L94] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L95] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L95] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=2655070710, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L96] var_1_21 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L97] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L98] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L114] RET updateVariables() [L115] CALL step() [L44] COND TRUE (var_1_4 - last_1_var_1_20) == last_1_var_1_18 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L45] COND FALSE !(((var_1_9 - var_1_10) - var_1_11) > var_1_12) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=-32, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L51] COND TRUE var_1_13 > var_1_6 [L52] var_1_18 = (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L54] COND FALSE !(\read(last_1_var_1_14)) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L57] var_1_20 = ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))) [L58] unsigned long int stepLocal_1 = var_1_20; [L59] unsigned long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, stepLocal_1=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L60] COND FALSE !((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > stepLocal_1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, stepLocal_0=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((((((((var_1_18) > (var_1_18)) ? (var_1_18) : (var_1_18))) / var_1_4) > var_1_20) ? ((var_1_20 == var_1_18) ? (var_1_1 == ((unsigned long int) 1000000000u)) : (var_1_1 == ((unsigned long int) 128u))) : 1) && (((var_1_4 - last_1_var_1_20) == last_1_var_1_18) ? ((((var_1_9 - var_1_10) - var_1_11) > var_1_12) ? (var_1_6 == ((unsigned short int) (var_1_13 - var_1_8))) : 1) : (var_1_6 == ((unsigned short int) var_1_13)))) && (last_1_var_1_14 ? (var_1_14 == ((unsigned char) (var_1_16 && var_1_17))) : 1)) && ((var_1_13 > var_1_6) ? (var_1_18 == ((signed long int) (((((var_1_6) < (var_1_13)) ? (var_1_6) : (var_1_13))) - var_1_6))) : 1)) && (var_1_20 == ((unsigned long int) ((((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) < ((var_1_21 - var_1_7))) ? (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20)))) : ((var_1_21 - var_1_7)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_18=-32, last_1_var_1_20=50, var_1_13=32767, var_1_14=0, var_1_16=1, var_1_17=1, var_1_18=0, var_1_1=0, var_1_20=50, var_1_21=-2147483649, var_1_4=18, var_1_6=10, var_1_7=17, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 9, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 1995 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1387 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1058 IncrementalHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 608 mSDtfsCounter, 1058 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=8, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 94 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1075 ConstructedInterpolants, 0 QuantifiedInterpolants, 5907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 6120/6156 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-04 00:57:11,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.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 65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:57:12,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:57:12,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:57:12,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:57:12,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:57:12,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:57:12,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:57:12,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:57:12,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:57:12,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:57:12,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:57:12,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:57:12,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:57:12,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:57:12,936 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:57:12,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:57:12,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:57:12,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:12,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:57:12,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:57:12,938 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 -> 65abe7cb35c9006c604c8d360a97fa1428e6f141c9dbba60a5491dff00208bf7 [2025-03-04 00:57:13,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:57:13,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:57:13,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:57:13,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:57:13,222 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:57:13,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i [2025-03-04 00:57:14,349 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40059c36b/b04e79ee54c44378b9d214139fd86c8a/FLAGe7f3ccfcf [2025-03-04 00:57:14,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:57:14,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i [2025-03-04 00:57:14,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40059c36b/b04e79ee54c44378b9d214139fd86c8a/FLAGe7f3ccfcf [2025-03-04 00:57:14,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40059c36b/b04e79ee54c44378b9d214139fd86c8a [2025-03-04 00:57:14,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:57:14,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:57:14,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:14,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:57:14,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:57:14,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:14" (1/1) ... [2025-03-04 00:57:14,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f31ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:14, skipping insertion in model container [2025-03-04 00:57:14,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:14" (1/1) ... [2025-03-04 00:57:14,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:57:15,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-6.i[912,925] [2025-03-04 00:57:15,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:15,089 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:57:15,099 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_variablewrapping_normal_file-6.i[912,925] [2025-03-04 00:57:15,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:15,127 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:57:15,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15 WrapperNode [2025-03-04 00:57:15,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:15,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:15,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:57:15,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:57:15,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,164 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-04 00:57:15,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:15,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:57:15,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:57:15,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:57:15,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,193 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-04 00:57:15,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:57:15,216 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:57:15,216 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:57:15,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:57:15,217 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (1/1) ... [2025-03-04 00:57:15,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:15,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:15,243 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-04 00:57:15,246 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-04 00:57:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:57:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:57:15,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:57:15,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:57:15,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:57:15,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:57:15,328 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:57:15,330 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:57:18,892 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:57:18,892 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:57:18,901 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:57:18,901 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:57:18,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:18 BoogieIcfgContainer [2025-03-04 00:57:18,902 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:57:18,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:57:18,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:57:18,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:57:18,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:57:14" (1/3) ... [2025-03-04 00:57:18,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210598bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:18, skipping insertion in model container [2025-03-04 00:57:18,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:15" (2/3) ... [2025-03-04 00:57:18,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210598bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:18, skipping insertion in model container [2025-03-04 00:57:18,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:18" (3/3) ... [2025-03-04 00:57:18,908 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-6.i [2025-03-04 00:57:18,916 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:57:18,917 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-6.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:57:18,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:57:18,963 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;@eb6095e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:57:18,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:57:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:57:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:57:18,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:18,974 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:57:18,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:18,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:18,977 INFO L85 PathProgramCache]: Analyzing trace with hash 332193008, now seen corresponding path program 1 times [2025-03-04 00:57:18,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:18,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691780058] [2025-03-04 00:57:18,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:18,985 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-04 00:57:18,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:18,987 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-04 00:57:18,989 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-04 00:57:19,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:57:19,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:57:19,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:19,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:19,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:57:19,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-04 00:57:19,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:57:19,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:57:19,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691780058] [2025-03-04 00:57:19,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691780058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:19,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:19,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:57:19,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247695267] [2025-03-04 00:57:19,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:19,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:57:19,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:57:19,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:57:19,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:57:19,307 INFO L87 Difference]: Start difference. First operand has 55 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:57:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:19,327 INFO L93 Difference]: Finished difference Result 104 states and 176 transitions. [2025-03-04 00:57:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:57:19,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2025-03-04 00:57:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:19,333 INFO L225 Difference]: With dead ends: 104 [2025-03-04 00:57:19,333 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:57:19,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-04 00:57:19,338 INFO L435 NwaCegarLoop]: 76 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, 76 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-04 00:57:19,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:57:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:57:19,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:57:19,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-04 00:57:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2025-03-04 00:57:19,362 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 120 [2025-03-04 00:57:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:19,362 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2025-03-04 00:57:19,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 00:57:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2025-03-04 00:57:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:57:19,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:19,364 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:57:19,375 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-04 00:57:19,565 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-04 00:57:19,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:19,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash -161895659, now seen corresponding path program 1 times [2025-03-04 00:57:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:19,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018463253] [2025-03-04 00:57:19,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:19,567 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-04 00:57:19,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:19,570 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-04 00:57:19,571 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-04 00:57:19,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:57:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:57:19,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:19,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:19,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:57:19,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:57:19,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:57:19,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:57:19,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018463253] [2025-03-04 00:57:19,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018463253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:19,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:19,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:57:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050034711] [2025-03-04 00:57:19,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:19,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:57:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:57:19,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:57:19,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:57:19,893 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:21,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:57:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:21,674 INFO L93 Difference]: Finished difference Result 136 states and 198 transitions. [2025-03-04 00:57:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:57:21,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2025-03-04 00:57:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:21,676 INFO L225 Difference]: With dead ends: 136 [2025-03-04 00:57:21,676 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 00:57:21,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 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-04 00:57:21,677 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 47 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:21,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:57:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 00:57:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-04 00:57:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 52 states have internal predecessors, (62), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 00:57:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2025-03-04 00:57:21,692 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 120 [2025-03-04 00:57:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:21,692 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2025-03-04 00:57:21,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2025-03-04 00:57:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:57:21,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:21,693 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:57:21,702 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-04 00:57:21,898 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-04 00:57:21,898 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:21,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1580914676, now seen corresponding path program 1 times [2025-03-04 00:57:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:21,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755354947] [2025-03-04 00:57:21,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:21,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-04 00:57:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:21,902 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-04 00:57:21,903 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-04 00:57:21,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:57:22,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:57:22,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:22,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:22,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 00:57:22,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-04 00:57:22,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:57:22,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:57:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755354947] [2025-03-04 00:57:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755354947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:22,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:22,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:57:22,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873474374] [2025-03-04 00:57:22,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:22,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:57:22,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:57:22,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:57:22,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:57:22,417 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:23,469 INFO L93 Difference]: Finished difference Result 165 states and 241 transitions. [2025-03-04 00:57:23,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:57:23,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2025-03-04 00:57:23,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:23,489 INFO L225 Difference]: With dead ends: 165 [2025-03-04 00:57:23,489 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 00:57:23,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:57:23,490 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:23,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 72 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:57:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 00:57:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 00:57:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 00:57:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-03-04 00:57:23,501 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 120 [2025-03-04 00:57:23,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:23,501 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-03-04 00:57:23,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-04 00:57:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-03-04 00:57:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 00:57:23,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:23,503 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:57:23,512 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-04 00:57:23,703 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-04 00:57:23,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:23,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1826548939, now seen corresponding path program 1 times [2025-03-04 00:57:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:23,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242615030] [2025-03-04 00:57:23,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:23,705 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-04 00:57:23,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:23,708 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-04 00:57:23,709 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-04 00:57:23,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 00:57:23,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 00:57:23,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:23,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:23,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:57:23,919 INFO L279 TraceCheckSpWp]: Computing forward predicates...