./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.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-67.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 ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:57:16,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:57:16,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:57:16,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:57:16,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:57:16,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:57:16,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:57:16,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:57:16,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:57:16,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:57:16,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:57:16,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:57:16,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:57:16,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:57:16,918 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:57:16,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:57:16,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:57:16,920 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:57:16,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:57:16,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:57:16,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:57:16,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:57:16,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:57:16,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:16,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:57:16,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:57:16,921 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 -> ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 [2025-03-04 00:57:17,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:57:17,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:57:17,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:57:17,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:57:17,170 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:57:17,171 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-67.i [2025-03-04 00:57:18,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a5181e0/c8a57f3cf5914e17af9c114b8d257520/FLAGfdffc4204 [2025-03-04 00:57:18,496 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:57:18,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i [2025-03-04 00:57:18,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a5181e0/c8a57f3cf5914e17af9c114b8d257520/FLAGfdffc4204 [2025-03-04 00:57:18,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a5181e0/c8a57f3cf5914e17af9c114b8d257520 [2025-03-04 00:57:18,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:57:18,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:57:18,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:18,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:57:18,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:57:18,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:18" (1/1) ... [2025-03-04 00:57:18,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cf7717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:18, skipping insertion in model container [2025-03-04 00:57:18,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:18" (1/1) ... [2025-03-04 00:57:18,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:57:19,008 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-67.i[913,926] [2025-03-04 00:57:19,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:19,062 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:57:19,071 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-67.i[913,926] [2025-03-04 00:57:19,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:19,106 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:57:19,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:19 WrapperNode [2025-03-04 00:57:19,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:19,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:19,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:57:19,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:57:19,113 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:19" (1/1) ... [2025-03-04 00:57:19,120 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:19" (1/1) ... [2025-03-04 00:57:19,149 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-03-04 00:57:19,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:19,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:57:19,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:57:19,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:57:19,158 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:19" (1/1) ... [2025-03-04 00:57:19,159 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:19" (1/1) ... [2025-03-04 00:57:19,160 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:19" (1/1) ... [2025-03-04 00:57:19,176 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:19,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:57:19" (1/1) ... [2025-03-04 00:57:19,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:57:19" (1/1) ... [2025-03-04 00:57:19,179 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:19" (1/1) ... [2025-03-04 00:57:19,180 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:19" (1/1) ... [2025-03-04 00:57:19,181 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:19" (1/1) ... [2025-03-04 00:57:19,181 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:19" (1/1) ... [2025-03-04 00:57:19,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:57:19,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:57:19,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:57:19,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:57:19,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:19" (1/1) ... [2025-03-04 00:57:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:19,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:19,211 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:19,213 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:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:57:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:57:19,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:57:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:57:19,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:57:19,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:57:19,278 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:57:19,279 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:57:19,499 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L94: havoc property_#t~bitwise11#1;havoc property_#t~short12#1; [2025-03-04 00:57:19,520 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-04 00:57:19,520 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:57:19,530 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:57:19,530 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:57:19,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:19 BoogieIcfgContainer [2025-03-04 00:57:19,530 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:57:19,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:57:19,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:57:19,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:57:19,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:57:18" (1/3) ... [2025-03-04 00:57:19,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e462973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:19, skipping insertion in model container [2025-03-04 00:57:19,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:19" (2/3) ... [2025-03-04 00:57:19,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e462973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:19, skipping insertion in model container [2025-03-04 00:57:19,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:19" (3/3) ... [2025-03-04 00:57:19,538 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-67.i [2025-03-04 00:57:19,548 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:57:19,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-67.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:57:19,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:57:19,599 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;@47309315, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:57:19,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:57:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:57:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 00:57:19,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:19,609 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:19,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1829609222, now seen corresponding path program 1 times [2025-03-04 00:57:19,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:19,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623499248] [2025-03-04 00:57:19,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:19,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:19,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 00:57:19,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 00:57:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 00:57:19,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:57:19,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623499248] [2025-03-04 00:57:19,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623499248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:57:19,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549718352] [2025-03-04 00:57:19,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:19,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:57:19,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:19,789 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:57:19,790 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:57:19,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 00:57:19,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 00:57:19,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:19,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:19,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:57:19,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:19,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 00:57:19,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:57:19,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549718352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:19,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:57:19,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:57:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498801715] [2025-03-04 00:57:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:19,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:57:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:57:19,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:57:19,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:57:19,926 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:57:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:19,945 INFO L93 Difference]: Finished difference Result 94 states and 149 transitions. [2025-03-04 00:57:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:57:19,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2025-03-04 00:57:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:19,953 INFO L225 Difference]: With dead ends: 94 [2025-03-04 00:57:19,954 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 00:57:19,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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,958 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:19,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:57:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 00:57:19,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 00:57:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:57:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-04 00:57:19,983 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 83 [2025-03-04 00:57:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:19,983 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-04 00:57:19,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:57:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-04 00:57:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 00:57:19,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:19,985 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:57:20,186 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:57:20,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:20,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1877332004, now seen corresponding path program 1 times [2025-03-04 00:57:20,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:20,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896089307] [2025-03-04 00:57:20,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:20,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:20,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 00:57:20,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 00:57:20,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:20,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 00:57:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:57:20,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896089307] [2025-03-04 00:57:20,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896089307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:20,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:20,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:57:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866711091] [2025-03-04 00:57:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:20,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:57:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:57:20,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:57:20,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:57:20,710 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:57:20,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:20,889 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2025-03-04 00:57:20,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:57:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-03-04 00:57:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:20,891 INFO L225 Difference]: With dead ends: 111 [2025-03-04 00:57:20,892 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 00:57:20,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:57:20,893 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:20,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 260 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:57:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 00:57:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2025-03-04 00:57:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:57:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 81 transitions. [2025-03-04 00:57:20,901 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 81 transitions. Word has length 83 [2025-03-04 00:57:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:20,902 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 81 transitions. [2025-03-04 00:57:20,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:57:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 81 transitions. [2025-03-04 00:57:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 00:57:20,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:20,903 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:57:20,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:20,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2006414723, now seen corresponding path program 1 times [2025-03-04 00:57:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:20,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739730150] [2025-03-04 00:57:20,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:20,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 00:57:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 00:57:20,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:20,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 00:57:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:57:21,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739730150] [2025-03-04 00:57:21,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739730150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:21,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:21,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:57:21,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64104726] [2025-03-04 00:57:21,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:21,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:57:21,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:57:21,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:57:21,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:57:21,095 INFO L87 Difference]: Start difference. First operand 57 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:57:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:21,158 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2025-03-04 00:57:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:57:21,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2025-03-04 00:57:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:21,159 INFO L225 Difference]: With dead ends: 121 [2025-03-04 00:57:21,159 INFO L226 Difference]: Without dead ends: 67 [2025-03-04 00:57:21,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:57:21,160 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 20 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:57:21,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 377 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:57:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-04 00:57:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2025-03-04 00:57:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:57:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 65 transitions. [2025-03-04 00:57:21,167 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 65 transitions. Word has length 83 [2025-03-04 00:57:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:21,167 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 65 transitions. [2025-03-04 00:57:21,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 00:57:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 65 transitions. [2025-03-04 00:57:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 00:57:21,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:21,168 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:57:21,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:21,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash -596607710, now seen corresponding path program 1 times [2025-03-04 00:57:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:57:21,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009860038] [2025-03-04 00:57:21,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:57:21,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 00:57:21,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 00:57:21,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:21,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:57:21,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [148844801] [2025-03-04 00:57:21,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:21,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:57:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:21,277 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:21,278 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:21,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 00:57:21,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 00:57:21,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:21,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:57:21,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:57:21,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 00:57:21,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 00:57:21,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:21,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:57:21,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:57:21,447 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:57:21,448 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:57:21,457 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:21,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 00:57:21,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:57:21,712 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:57:21,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:57:21 BoogieIcfgContainer [2025-03-04 00:57:21,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:57:21,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:57:21,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:57:21,715 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:57:21,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:19" (3/4) ... [2025-03-04 00:57:21,717 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:57:21,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:57:21,719 INFO L158 Benchmark]: Toolchain (without parser) took 2851.74ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 117.9MB in the end (delta: 5.8MB). Peak memory consumption was 361.8kB. Max. memory is 16.1GB. [2025-03-04 00:57:21,719 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:21,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.29ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 111.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:57:21,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.04ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 108.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:57:21,719 INFO L158 Benchmark]: Boogie Preprocessor took 30.56ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:21,720 INFO L158 Benchmark]: IcfgBuilder took 347.28ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 89.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:57:21,720 INFO L158 Benchmark]: TraceAbstraction took 2182.08ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 117.9MB in the end (delta: -29.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:21,720 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 117.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:57:21,722 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.99ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.29ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 111.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.04ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 108.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.56ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.4MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 347.28ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 89.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2182.08ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 117.9MB in the end (delta: -29.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 117.9MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed short int var_1_4 = -64; [L24] signed short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 128; [L26] unsigned short int var_1_7 = 256; [L27] signed long int var_1_8 = 50; [L28] unsigned char var_1_9 = 0; [L29] signed long int var_1_10 = -4; [L30] float var_1_11 = 15.125; [L31] float var_1_12 = 0.9; [L32] double var_1_13 = 25.875; [L33] unsigned short int var_1_14 = 50; [L34] signed short int last_1_var_1_1 = 2; [L35] unsigned short int last_1_var_1_6 = 128; [L36] signed long int last_1_var_1_8 = 50; VAL [isInitial=0, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L89] last_1_var_1_1 = var_1_1 [L90] last_1_var_1_6 = var_1_6 [L91] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-64, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L72] var_1_5 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L73] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L74] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L75] var_1_7 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=0] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50] [L80] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L80] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L81] var_1_10 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L83] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L84] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L85] var_1_12 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE ! (last_1_var_1_6 <= last_1_var_1_1) [L41] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L43] signed long int stepLocal_0 = 1 * var_1_4; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=-1, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L44] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=-1, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=0, var_1_8=50, var_1_9=1] [L44] COND TRUE (var_1_1 >> var_1_5) > stepLocal_0 [L45] var_1_6 = (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L49] var_1_11 = var_1_12 [L50] var_1_13 = var_1_12 [L51] var_1_14 = var_1_7 [L52] signed long int stepLocal_2 = var_1_4 / var_1_10; [L53] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_1=0, stepLocal_2=0, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L54] COND TRUE \read(var_1_9) [L55] var_1_8 = ((((var_1_6) < (last_1_var_1_8)) ? (var_1_6) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_1=0, stepLocal_2=0, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L94] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L94] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L94-L95] return ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7)))) && (var_1_9 ? (var_1_8 == ((signed long int) ((((var_1_6) < (last_1_var_1_8)) ? (var_1_6) : (last_1_var_1_8))))) : ((var_1_14 > (var_1_4 / var_1_10)) ? ((var_1_7 > var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_4) < (100)) ? (var_1_4) : (100))))) : (var_1_8 == ((signed long int) (last_1_var_1_8 - var_1_7)))) : (var_1_8 == ((signed long int) (var_1_6 + var_1_5)))))) && (var_1_11 == ((float) var_1_12))) && (var_1_13 == ((double) var_1_12))) && (var_1_14 == ((unsigned short int) var_1_7)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=42286, var_1_7=0, var_1_8=50, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 701 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 494 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 151 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 207 mSDtfsCounter, 151 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 502 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 604 SizeOfPredicates, 0 NumberOfNonLiveVariables, 219 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1034/1056 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:21,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.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 ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:57:23,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:57:23,636 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:23,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:57:23,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:57:23,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:57:23,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:57:23,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:57:23,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:57:23,666 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:57:23,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:57:23,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:57:23,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:57:23,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:57:23,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:57:23,670 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:57:23,670 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:57:23,670 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:57:23,670 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:57:23,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:57:23,670 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:57:23,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:57:23,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:23,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:57:23,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:57:23,671 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 -> ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 [2025-03-04 00:57:23,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:57:23,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:57:23,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:57:23,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:57:23,938 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:57:23,940 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-67.i [2025-03-04 00:57:25,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690954a08/1b61eb6453084ffb9cc3d732ddac9791/FLAG12334ee97 [2025-03-04 00:57:25,294 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:57:25,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i [2025-03-04 00:57:25,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690954a08/1b61eb6453084ffb9cc3d732ddac9791/FLAG12334ee97 [2025-03-04 00:57:25,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/690954a08/1b61eb6453084ffb9cc3d732ddac9791 [2025-03-04 00:57:25,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:57:25,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:57:25,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:25,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:57:25,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:57:25,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:25" (1/1) ... [2025-03-04 00:57:25,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1112d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:25, skipping insertion in model container [2025-03-04 00:57:25,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:57:25" (1/1) ... [2025-03-04 00:57:25,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:57:25,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i[913,926] [2025-03-04 00:57:25,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:25,802 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:57:25,810 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-67.i[913,926] [2025-03-04 00:57:25,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:57:25,835 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:57:25,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:25 WrapperNode [2025-03-04 00:57:25,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:57:25,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:25,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:57:25,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:57:25,841 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:25" (1/1) ... [2025-03-04 00:57:25,847 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:25" (1/1) ... [2025-03-04 00:57:25,860 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 97 [2025-03-04 00:57:25,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:57:25,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:57:25,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:57:25,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:57:25,866 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:25" (1/1) ... [2025-03-04 00:57:25,867 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:25" (1/1) ... [2025-03-04 00:57:25,868 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:25" (1/1) ... [2025-03-04 00:57:25,876 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:25,877 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:25" (1/1) ... [2025-03-04 00:57:25,877 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:25" (1/1) ... [2025-03-04 00:57:25,884 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:25" (1/1) ... [2025-03-04 00:57:25,885 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:25" (1/1) ... [2025-03-04 00:57:25,887 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:25" (1/1) ... [2025-03-04 00:57:25,887 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:25" (1/1) ... [2025-03-04 00:57:25,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:57:25,890 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:57:25,890 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:57:25,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:57:25,891 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:25" (1/1) ... [2025-03-04 00:57:25,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:57:25,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:57:25,923 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:25,929 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:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:57:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:57:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:57:25,943 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:57:25,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:57:25,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:57:26,003 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:57:26,005 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:57:26,361 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:57:26,361 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:57:26,367 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:57:26,367 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:57:26,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:26 BoogieIcfgContainer [2025-03-04 00:57:26,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:57:26,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:57:26,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:57:26,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:57:26,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:57:25" (1/3) ... [2025-03-04 00:57:26,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30108c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:26, skipping insertion in model container [2025-03-04 00:57:26,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:57:25" (2/3) ... [2025-03-04 00:57:26,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30108c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:57:26, skipping insertion in model container [2025-03-04 00:57:26,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:57:26" (3/3) ... [2025-03-04 00:57:26,375 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-67.i [2025-03-04 00:57:26,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:57:26,386 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-67.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:57:26,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:57:26,429 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;@788cd719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:57:26,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:57:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:57:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 00:57:26,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:26,440 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1242817924, now seen corresponding path program 1 times [2025-03-04 00:57:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:26,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156644638] [2025-03-04 00:57:26,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:26,452 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:26,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:26,455 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:26,456 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:26,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 00:57:26,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 00:57:26,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:26,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:26,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:57:26,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:57:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 00:57:26,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:57:26,659 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:57:26,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156644638] [2025-03-04 00:57:26,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156644638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:57:26,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:57:26,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:57:26,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414709943] [2025-03-04 00:57:26,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:57:26,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:57:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:57:26,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:57:26,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:57:26,678 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:57:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:57:26,693 INFO L93 Difference]: Finished difference Result 80 states and 129 transitions. [2025-03-04 00:57:26,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:57:26,696 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-03-04 00:57:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:57:26,701 INFO L225 Difference]: With dead ends: 80 [2025-03-04 00:57:26,702 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 00:57:26,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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:26,708 INFO L435 NwaCegarLoop]: 56 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, 56 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:26,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 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:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 00:57:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 00:57:26,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:57:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-04 00:57:26,741 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2025-03-04 00:57:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:57:26,741 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-04 00:57:26,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:57:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-04 00:57:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 00:57:26,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:57:26,759 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,768 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:26,959 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:26,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:57:26,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:57:26,961 INFO L85 PathProgramCache]: Analyzing trace with hash 64518438, now seen corresponding path program 1 times [2025-03-04 00:57:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:57:26,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713243479] [2025-03-04 00:57:26,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:57:26,961 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:26,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:57:26,963 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:26,965 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:27,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 00:57:27,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 00:57:27,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:57:27,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:57:27,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 00:57:27,127 INFO L279 TraceCheckSpWp]: Computing forward predicates...