./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.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 ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:05:12,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:05:12,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:05:12,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:05:12,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:05:12,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:05:12,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:05:12,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:05:12,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:05:12,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:05:12,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:05:12,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:05:12,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:05:12,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:05:12,402 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:05:12,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:05:12,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:05:12,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:05:12,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:05:12,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:05:12,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:05:12,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:05:12,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:05:12,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:05:12,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:05:12,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:05:12,405 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 -> ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 [2025-03-08 16:05:12,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:05:12,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:05:12,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:05:12,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:05:12,636 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:05:12,637 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-38.i [2025-03-08 16:05:13,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90f05731/852a9588c4d2442399925b2b8184687a/FLAG16f1a355c [2025-03-08 16:05:14,006 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:05:14,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i [2025-03-08 16:05:14,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90f05731/852a9588c4d2442399925b2b8184687a/FLAG16f1a355c [2025-03-08 16:05:14,346 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90f05731/852a9588c4d2442399925b2b8184687a [2025-03-08 16:05:14,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:05:14,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:05:14,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:05:14,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:05:14,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:05:14,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f04cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14, skipping insertion in model container [2025-03-08 16:05:14,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:05:14,469 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-38.i[913,926] [2025-03-08 16:05:14,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:05:14,532 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:05:14,540 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-38.i[913,926] [2025-03-08 16:05:14,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:05:14,567 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:05:14,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14 WrapperNode [2025-03-08 16:05:14,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:05:14,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:05:14,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:05:14,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:05:14,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,596 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-08 16:05:14,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:05:14,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:05:14,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:05:14,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:05:14,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,615 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:05:14,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:05:14,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:05:14,625 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:05:14,625 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:05:14,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (1/1) ... [2025-03-08 16:05:14,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:05:14,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:05:14,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:05:14,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:05:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:05:14,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:05:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:05:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:05:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:05:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:05:14,733 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:05:14,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:05:14,946 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 16:05:14,946 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:05:14,953 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:05:14,953 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:05:14,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:14 BoogieIcfgContainer [2025-03-08 16:05:14,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:05:14,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:05:14,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:05:14,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:05:14,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:05:14" (1/3) ... [2025-03-08 16:05:14,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe154ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:05:14, skipping insertion in model container [2025-03-08 16:05:14,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:14" (2/3) ... [2025-03-08 16:05:14,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe154ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:05:14, skipping insertion in model container [2025-03-08 16:05:14,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:14" (3/3) ... [2025-03-08 16:05:14,960 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-38.i [2025-03-08 16:05:14,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:05:14,972 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-38.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:05:15,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:05:15,029 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;@9156b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:05:15,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:05:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:05:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:05:15,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:15,045 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:05:15,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:15,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 297985217, now seen corresponding path program 1 times [2025-03-08 16:05:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:05:15,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851680784] [2025-03-08 16:05:15,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:15,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:05:15,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:15,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:15,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:15,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 16:05:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:05:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851680784] [2025-03-08 16:05:15,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851680784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:05:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016371340] [2025-03-08 16:05:15,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:05:15,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:05:15,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:05:15,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:05:15,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:15,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:15,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:15,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:15,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:05:15,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:05:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-08 16:05:15,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:05:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016371340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:05:15,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:05:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:05:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142443918] [2025-03-08 16:05:15,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:05:15,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:05:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:05:15,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:05:15,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:05:15,502 INFO L87 Difference]: Start difference. First operand has 62 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 16:05:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:05:15,524 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2025-03-08 16:05:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:05:15,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2025-03-08 16:05:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:05:15,530 INFO L225 Difference]: With dead ends: 118 [2025-03-08 16:05:15,530 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 16:05:15,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:05:15,536 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:05:15,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:05:15,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 16:05:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 16:05:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:05:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-03-08 16:05:15,565 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 148 [2025-03-08 16:05:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:05:15,565 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-03-08 16:05:15,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 16:05:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-03-08 16:05:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:05:15,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:15,569 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:05:15,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:05:15,774 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-08 16:05:15,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:15,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1672495803, now seen corresponding path program 1 times [2025-03-08 16:05:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:05:15,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041358785] [2025-03-08 16:05:15,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:15,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:05:15,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:15,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:15,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:15,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 16:05:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:05:15,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041358785] [2025-03-08 16:05:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041358785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:05:15,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:05:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:05:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239980730] [2025-03-08 16:05:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:05:15,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:05:15,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:05:15,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:05:15,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:05:15,973 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 16:05:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:05:16,017 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2025-03-08 16:05:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:05:16,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 148 [2025-03-08 16:05:16,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:05:16,021 INFO L225 Difference]: With dead ends: 149 [2025-03-08 16:05:16,021 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:05:16,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:05:16,024 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:05:16,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 158 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:05:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:05:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-08 16:05:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:05:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-03-08 16:05:16,043 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 148 [2025-03-08 16:05:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:05:16,045 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-03-08 16:05:16,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 16:05:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-03-08 16:05:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:05:16,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:16,047 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:05:16,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:05:16,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:16,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:16,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1671572282, now seen corresponding path program 1 times [2025-03-08 16:05:16,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:05:16,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880563461] [2025-03-08 16:05:16,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:16,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:05:16,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:16,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:16,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:16,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 120 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-03-08 16:05:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:05:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880563461] [2025-03-08 16:05:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880563461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:05:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148019577] [2025-03-08 16:05:16,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:16,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:05:16,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:05:16,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:05:16,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:05:16,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:16,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:16,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:16,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:16,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 16:05:16,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:05:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 297 proven. 180 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2025-03-08 16:05:17,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:05:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-08 16:05:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148019577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:05:18,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:05:18,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 20 [2025-03-08 16:05:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441183671] [2025-03-08 16:05:18,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:05:18,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:05:18,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:05:18,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:05:18,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:05:18,283 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 6 states have call successors, (65), 4 states have call predecessors, (65), 8 states have return successors, (67), 5 states have call predecessors, (67), 6 states have call successors, (67) [2025-03-08 16:05:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:05:18,663 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. [2025-03-08 16:05:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 16:05:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 6 states have call successors, (65), 4 states have call predecessors, (65), 8 states have return successors, (67), 5 states have call predecessors, (67), 6 states have call successors, (67) Word has length 148 [2025-03-08 16:05:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:05:18,666 INFO L225 Difference]: With dead ends: 207 [2025-03-08 16:05:18,666 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 16:05:18,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=585, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:05:18,667 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 97 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:05:18,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 226 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:05:18,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 16:05:18,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2025-03-08 16:05:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 70 states have internal predecessors, (74), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:05:18,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2025-03-08 16:05:18,687 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 148 [2025-03-08 16:05:18,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:05:18,687 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2025-03-08 16:05:18,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 6 states have call successors, (65), 4 states have call predecessors, (65), 8 states have return successors, (67), 5 states have call predecessors, (67), 6 states have call successors, (67) [2025-03-08 16:05:18,688 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2025-03-08 16:05:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:05:18,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:18,691 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:05:18,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:05:18,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 16:05:18,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:18,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 815940551, now seen corresponding path program 1 times [2025-03-08 16:05:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:05:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421515465] [2025-03-08 16:05:18,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:05:18,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:18,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:18,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:18,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:05:18,958 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:05:18,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:19,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:19,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:19,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:05:19,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:05:19,075 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:05:19,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:05:19,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:05:19,080 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 16:05:19,153 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:05:19,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:05:19 BoogieIcfgContainer [2025-03-08 16:05:19,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:05:19,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:05:19,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:05:19,157 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:05:19,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:14" (3/4) ... [2025-03-08 16:05:19,159 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:05:19,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:05:19,161 INFO L158 Benchmark]: Toolchain (without parser) took 4811.47ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.2MB in the beginning and 67.7MB in the end (delta: 45.4MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2025-03-08 16:05:19,161 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:05:19,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.70ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:05:19,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.94ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 97.1MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:05:19,162 INFO L158 Benchmark]: Boogie Preprocessor took 26.82ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 93.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:05:19,162 INFO L158 Benchmark]: IcfgBuilder took 329.02ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 74.0MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:05:19,163 INFO L158 Benchmark]: TraceAbstraction took 4201.06ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 73.3MB in the beginning and 67.8MB in the end (delta: 5.6MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2025-03-08 16:05:19,163 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 176.2MB. Free memory was 67.8MB in the beginning and 67.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:05:19,164 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.79ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.70ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.8MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.94ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 97.1MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.82ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 93.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 329.02ms. Allocated memory is still 142.6MB. Free memory was 93.0MB in the beginning and 74.0MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4201.06ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 73.3MB in the beginning and 67.8MB in the end (delta: 5.6MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 176.2MB. Free memory was 67.8MB in the beginning and 67.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_3 = 52902; [L25] unsigned short int var_1_4 = 8; [L26] unsigned long int var_1_5 = 16; [L27] unsigned long int var_1_6 = 1771558822; [L28] double var_1_7 = 7.25; [L29] double var_1_8 = 31.2; [L30] double var_1_9 = 32.71; [L31] double var_1_10 = 0.4; [L32] double var_1_11 = 7.75; [L33] unsigned short int var_1_12 = 32; [L34] unsigned char var_1_13 = 0; [L35] unsigned short int var_1_14 = 20114; [L36] unsigned short int var_1_15 = 32; [L37] unsigned short int var_1_16 = 16773; [L38] unsigned short int var_1_17 = 25; [L39] unsigned char var_1_18 = 0; [L40] unsigned char var_1_19 = 1; VAL [isInitial=0, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=56507, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_ushort() [L66] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L66] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L67] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=52902, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L68] var_1_3 = __VERIFIER_nondet_ushort() [L69] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L69] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L70] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=8, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L71] var_1_4 = __VERIFIER_nondet_ushort() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L73] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1771558822, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L74] var_1_6 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L75] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L76] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_8=156/5, var_1_9=3271/100] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L78] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4, var_1_9=3271/100] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L80] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L82] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=31/4, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L84] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L86] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=32, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L87] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L87] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=20114, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L88] var_1_14 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L89] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L90] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L90] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=32, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L91] var_1_15 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L93] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L93] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=16773, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L94] var_1_16 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L95] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L96] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L96] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=0, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L97] var_1_18 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L98] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L99] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L99] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L100] var_1_19 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L101] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L102] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L102] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=0, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L115] RET updateVariables() [L116] CALL step() [L44] var_1_1 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4) [L45] unsigned short int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-2, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L46] COND FALSE !(var_1_4 > stepLocal_0) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735, var_1_7=29/4] [L49] var_1_7 = (var_1_8 + (var_1_9 + (var_1_10 + var_1_11))) VAL [isInitial=1, var_1_12=32, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735] [L50] COND TRUE ! var_1_13 [L51] var_1_12 = (var_1_3 - (var_1_14 - var_1_15)) VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735] [L59] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, stepLocal_1=-255, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735] [L60] COND FALSE !((var_1_13 && var_1_18) && stepLocal_1) VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((var_1_1 == ((unsigned short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) - var_1_4))) && ((var_1_4 > var_1_2) ? (var_1_5 == ((unsigned long int) (((var_1_6 - var_1_3) + 2144048120u) - var_1_2))) : 1)) && (var_1_7 == ((double) (var_1_8 + (var_1_9 + (var_1_10 + var_1_11)))))) && ((! var_1_13) ? (var_1_12 == ((unsigned short int) (var_1_3 - (var_1_14 - var_1_15)))) : (var_1_13 ? (var_1_12 == ((unsigned short int) ((27636 + var_1_16) - (((((16853 - 10)) > (var_1_14)) ? ((16853 - 10)) : (var_1_14)))))) : (var_1_12 == ((unsigned short int) var_1_3))))) && (((var_1_13 && var_1_18) && var_1_19) ? (var_1_17 == ((unsigned short int) (var_1_15 + var_1_14))) : 1) ; VAL [\result=0, isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735] [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735] [L19] reach_error() VAL [isInitial=1, var_1_12=65534, var_1_13=0, var_1_14=16383, var_1_15=16383, var_1_16=-1103806464, var_1_17=25, var_1_18=1, var_1_19=-255, var_1_1=65534, var_1_2=-2, var_1_3=-1073610754, var_1_4=0, var_1_5=16, var_1_6=1610612735] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 115 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 470 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 239 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 231 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 436 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 888 NumberOfCodeBlocks, 888 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 882 ConstructedInterpolants, 0 QuantifiedInterpolants, 3495 SizeOfPredicates, 3 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 6155/6624 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:05:19,181 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-38.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 ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:05:20,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:05:21,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:05:21,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:05:21,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:05:21,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:05:21,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:05:21,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:05:21,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:05:21,102 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:05:21,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:05:21,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:05:21,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:05:21,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:05:21,103 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:05:21,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:05:21,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:05:21,104 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:05:21,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:05:21,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:05:21,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:05:21,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:05:21,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:05:21,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:05:21,105 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:05:21,105 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:05:21,105 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:05:21,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:05:21,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:05:21,105 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:05:21,105 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:05:21,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:05:21,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:05:21,106 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 -> ad5576ee265c689e1f97ecb60d806cc436384909a7661aea27074eb324006ed2 [2025-03-08 16:05:21,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:05:21,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:05:21,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:05:21,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:05:21,346 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:05:21,347 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-38.i [2025-03-08 16:05:22,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b53fbeb/8517969317bc4a809013e2879679f140/FLAGe9e7dbfa6 [2025-03-08 16:05:22,702 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:05:22,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-38.i [2025-03-08 16:05:22,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b53fbeb/8517969317bc4a809013e2879679f140/FLAGe9e7dbfa6 [2025-03-08 16:05:23,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b53fbeb/8517969317bc4a809013e2879679f140 [2025-03-08 16:05:23,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:05:23,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:05:23,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:05:23,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:05:23,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:05:23,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5aa578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23, skipping insertion in model container [2025-03-08 16:05:23,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:05:23,184 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-38.i[913,926] [2025-03-08 16:05:23,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:05:23,229 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:05:23,240 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-38.i[913,926] [2025-03-08 16:05:23,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:05:23,271 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:05:23,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23 WrapperNode [2025-03-08 16:05:23,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:05:23,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:05:23,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:05:23,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:05:23,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,303 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-08 16:05:23,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:05:23,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:05:23,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:05:23,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:05:23,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,324 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:05:23,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:05:23,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:05:23,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:05:23,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:05:23,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (1/1) ... [2025-03-08 16:05:23,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:05:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:05:23,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:05:23,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:05:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:05:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:05:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:05:23,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:05:23,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:05:23,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:05:23,450 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:05:23,452 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:05:28,098 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 16:05:28,098 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:05:28,105 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:05:28,105 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:05:28,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:28 BoogieIcfgContainer [2025-03-08 16:05:28,106 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:05:28,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:05:28,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:05:28,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:05:28,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:05:23" (1/3) ... [2025-03-08 16:05:28,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fae827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:05:28, skipping insertion in model container [2025-03-08 16:05:28,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:05:23" (2/3) ... [2025-03-08 16:05:28,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20fae827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:05:28, skipping insertion in model container [2025-03-08 16:05:28,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:05:28" (3/3) ... [2025-03-08 16:05:28,114 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-38.i [2025-03-08 16:05:28,124 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:05:28,125 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-38.i that has 2 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:05:28,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:05:28,183 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;@357c0863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:05:28,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:05:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:05:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:05:28,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:28,194 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:05:28,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:28,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:28,200 INFO L85 PathProgramCache]: Analyzing trace with hash 297985217, now seen corresponding path program 1 times [2025-03-08 16:05:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:05:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049243292] [2025-03-08 16:05:28,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:28,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:05:28,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:05:28,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:05:28,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:05:28,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:28,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:28,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:28,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:28,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:05:28,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:05:28,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-08 16:05:28,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:05:28,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:05:28,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049243292] [2025-03-08 16:05:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049243292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:05:28,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:05:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:05:28,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772476053] [2025-03-08 16:05:28,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:05:28,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:05:28,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:05:28,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:05:28,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:05:28,562 INFO L87 Difference]: Start difference. First operand has 62 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 16:05:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:05:28,584 INFO L93 Difference]: Finished difference Result 118 states and 201 transitions. [2025-03-08 16:05:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:05:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2025-03-08 16:05:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:05:28,590 INFO L225 Difference]: With dead ends: 118 [2025-03-08 16:05:28,590 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 16:05:28,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:05:28,596 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:05:28,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:05:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 16:05:28,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 16:05:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:05:28,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2025-03-08 16:05:28,636 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 148 [2025-03-08 16:05:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:05:28,636 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2025-03-08 16:05:28,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 16:05:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2025-03-08 16:05:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:05:28,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:28,642 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:05:28,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:05:28,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:05:28,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:28,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:28,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1672495803, now seen corresponding path program 1 times [2025-03-08 16:05:28,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:05:28,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29688927] [2025-03-08 16:05:28,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:28,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:05:28,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:05:28,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:05:28,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:05:28,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:29,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:29,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:29,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:29,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 16:05:29,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:05:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-08 16:05:29,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:05:29,176 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:05:29,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29688927] [2025-03-08 16:05:29,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29688927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:05:29,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:05:29,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:05:29,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741948859] [2025-03-08 16:05:29,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:05:29,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:05:29,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:05:29,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:05:29,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:05:29,180 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 16:05:31,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:05:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:05:31,478 INFO L93 Difference]: Finished difference Result 149 states and 215 transitions. [2025-03-08 16:05:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:05:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 148 [2025-03-08 16:05:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:05:31,502 INFO L225 Difference]: With dead ends: 149 [2025-03-08 16:05:31,502 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:05:31,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:05:31,503 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:05:31,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 157 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 16:05:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:05:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-08 16:05:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:05:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-03-08 16:05:31,516 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 148 [2025-03-08 16:05:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:05:31,516 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-03-08 16:05:31,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-08 16:05:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-03-08 16:05:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:05:31,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:05:31,518 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:05:31,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:05:31,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:05:31,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:05:31,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:05:31,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1671572282, now seen corresponding path program 1 times [2025-03-08 16:05:31,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:05:31,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359400183] [2025-03-08 16:05:31,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:05:31,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:05:31,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:05:31,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:05:31,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:05:31,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:05:32,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:05:32,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:05:32,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:05:32,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 16:05:32,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:06:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 339 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-03-08 16:06:04,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:06:47,010 WARN L286 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)