./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:53:35,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:53:35,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 20:53:35,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:53:35,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:53:35,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:53:35,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:53:35,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:53:35,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:53:35,865 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:53:35,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:53:35,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:53:35,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:53:35,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:53:35,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:53:35,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:53:35,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:53:35,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:53:35,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:53:35,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:53:35,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:53:35,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:53:35,869 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-jdk21/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 -> a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c [2025-02-05 20:53:36,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:53:36,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:53:36,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:53:36,092 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:53:36,092 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:53:36,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2025-02-05 20:53:37,185 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f4ee88eb/ef1bbcc36cb14dae9b022a96cff8a2ff/FLAGe83bdd94c [2025-02-05 20:53:37,429 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:53:37,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2025-02-05 20:53:37,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f4ee88eb/ef1bbcc36cb14dae9b022a96cff8a2ff/FLAGe83bdd94c [2025-02-05 20:53:37,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f4ee88eb/ef1bbcc36cb14dae9b022a96cff8a2ff [2025-02-05 20:53:37,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:53:37,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:53:37,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:53:37,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:53:37,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:53:37,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:37,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f4046f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37, skipping insertion in model container [2025-02-05 20:53:37,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:37,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:53:37,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i[916,929] [2025-02-05 20:53:37,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:53:37,931 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:53:37,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i[916,929] [2025-02-05 20:53:37,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:53:37,983 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:53:37,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37 WrapperNode [2025-02-05 20:53:37,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:53:37,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:53:37,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:53:37,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:53:37,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,025 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2025-02-05 20:53:38,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:53:38,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:53:38,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:53:38,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:53:38,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,043 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-02-05 20:53:38,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:53:38,052 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:53:38,052 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:53:38,052 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:53:38,053 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (1/1) ... [2025-02-05 20:53:38,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:53:38,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:38,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:53:38,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:53:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:53:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:53:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:53:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:53:38,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:53:38,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:53:38,158 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:53:38,159 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:53:38,369 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-02-05 20:53:38,395 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 20:53:38,395 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:53:38,408 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:53:38,408 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:53:38,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:53:38 BoogieIcfgContainer [2025-02-05 20:53:38,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:53:38,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:53:38,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:53:38,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:53:38,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:53:37" (1/3) ... [2025-02-05 20:53:38,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce4b19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:53:38, skipping insertion in model container [2025-02-05 20:53:38,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:37" (2/3) ... [2025-02-05 20:53:38,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce4b19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:53:38, skipping insertion in model container [2025-02-05 20:53:38,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:53:38" (3/3) ... [2025-02-05 20:53:38,415 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-9.i [2025-02-05 20:53:38,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:53:38,426 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-9.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:53:38,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:53:38,478 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;@58392432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:53:38,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:53:38,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 60 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 20:53:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 20:53:38,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:38,493 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:38,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:38,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:38,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1044246689, now seen corresponding path program 1 times [2025-02-05 20:53:38,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788422283] [2025-02-05 20:53:38,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:38,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:38,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 20:53:38,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 20:53:38,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:38,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-05 20:53:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788422283] [2025-02-05 20:53:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788422283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:38,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65701674] [2025-02-05 20:53:38,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:38,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:38,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:38,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:53:38,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:53:38,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 20:53:38,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 20:53:38,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:38,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:38,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:53:38,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:53:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-02-05 20:53:38,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:53:38,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65701674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:53:38,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:53:38,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 20:53:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492826944] [2025-02-05 20:53:38,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:38,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:53:38,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:38,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:53:38,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:53:38,923 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 60 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 20:53:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:38,954 INFO L93 Difference]: Finished difference Result 160 states and 262 transitions. [2025-02-05 20:53:38,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:53:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 143 [2025-02-05 20:53:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:38,961 INFO L225 Difference]: With dead ends: 160 [2025-02-05 20:53:38,961 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 20:53:38,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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-02-05 20:53:38,965 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:38,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:53:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 20:53:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-05 20:53:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 20:53:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2025-02-05 20:53:38,995 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 143 [2025-02-05 20:53:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:38,996 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2025-02-05 20:53:38,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 20:53:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2025-02-05 20:53:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 20:53:38,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:38,998 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:39,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 20:53:39,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 20:53:39,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:39,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1357526014, now seen corresponding path program 1 times [2025-02-05 20:53:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823359270] [2025-02-05 20:53:39,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:39,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 20:53:39,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 20:53:39,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:39,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:53:39,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:39,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823359270] [2025-02-05 20:53:39,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823359270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:53:39,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:53:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:53:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4583541] [2025-02-05 20:53:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:39,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:53:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:39,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:53:39,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:53:39,452 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:39,480 INFO L93 Difference]: Finished difference Result 158 states and 235 transitions. [2025-02-05 20:53:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:53:39,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2025-02-05 20:53:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:39,484 INFO L225 Difference]: With dead ends: 158 [2025-02-05 20:53:39,484 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 20:53:39,484 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-02-05 20:53:39,485 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:39,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:53:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 20:53:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-05 20:53:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 20:53:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2025-02-05 20:53:39,499 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 143 [2025-02-05 20:53:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:39,500 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2025-02-05 20:53:39,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2025-02-05 20:53:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:53:39,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:39,502 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:39,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:53:39,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:39,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1156376977, now seen corresponding path program 1 times [2025-02-05 20:53:39,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:39,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280312560] [2025-02-05 20:53:39,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:39,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:39,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:39,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:39,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:39,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 20:53:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280312560] [2025-02-05 20:53:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280312560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309417098] [2025-02-05 20:53:41,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:41,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:41,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:41,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:53:41,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:53:41,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:41,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:41,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:41,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:41,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 20:53:41,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:53:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 308 proven. 12 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-02-05 20:53:41,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:53:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:53:41,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309417098] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:41,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:53:41,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 19 [2025-02-05 20:53:41,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283022550] [2025-02-05 20:53:41,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:41,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:53:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:41,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:53:41,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:53:41,878 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:42,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:42,142 INFO L93 Difference]: Finished difference Result 203 states and 296 transitions. [2025-02-05 20:53:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:53:42,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-02-05 20:53:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:42,144 INFO L225 Difference]: With dead ends: 203 [2025-02-05 20:53:42,144 INFO L226 Difference]: Without dead ends: 125 [2025-02-05 20:53:42,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:53:42,145 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 47 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:42,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 560 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:53:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-05 20:53:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2025-02-05 20:53:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.351063829787234) internal successors, (127), 95 states have internal predecessors, (127), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 20:53:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2025-02-05 20:53:42,163 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 144 [2025-02-05 20:53:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:42,163 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2025-02-05 20:53:42,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2025-02-05 20:53:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:53:42,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:42,166 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:42,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:53:42,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:42,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:42,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash 196932720, now seen corresponding path program 1 times [2025-02-05 20:53:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580223394] [2025-02-05 20:53:42,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:42,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:42,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:42,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:42,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 20:53:43,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580223394] [2025-02-05 20:53:43,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580223394] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:43,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41360372] [2025-02-05 20:53:43,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:43,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:43,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:43,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:53:43,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:53:43,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:43,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:43,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:43,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:43,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 20:53:43,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:53:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:53:43,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:53:43,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41360372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:53:43,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:53:43,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16 [2025-02-05 20:53:43,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760190285] [2025-02-05 20:53:43,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:43,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:53:43,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:43,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:53:43,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:53:43,746 INFO L87 Difference]: Start difference. First operand 122 states and 177 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:44,102 INFO L93 Difference]: Finished difference Result 399 states and 574 transitions. [2025-02-05 20:53:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:53:44,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-02-05 20:53:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:44,106 INFO L225 Difference]: With dead ends: 399 [2025-02-05 20:53:44,107 INFO L226 Difference]: Without dead ends: 280 [2025-02-05 20:53:44,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:53:44,109 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 158 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:44,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 639 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:53:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-05 20:53:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 207. [2025-02-05 20:53:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.4147727272727273) internal successors, (249), 178 states have internal predecessors, (249), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 20:53:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 303 transitions. [2025-02-05 20:53:44,121 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 303 transitions. Word has length 144 [2025-02-05 20:53:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:44,123 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 303 transitions. [2025-02-05 20:53:44,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 303 transitions. [2025-02-05 20:53:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:53:44,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:44,124 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:44,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 20:53:44,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:44,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash 120768887, now seen corresponding path program 1 times [2025-02-05 20:53:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:44,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145725129] [2025-02-05 20:53:44,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:44,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:44,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:44,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:44,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:44,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 20:53:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145725129] [2025-02-05 20:53:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145725129] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556939383] [2025-02-05 20:53:45,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:45,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:45,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:45,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:53:45,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 20:53:45,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:45,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:45,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:45,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:45,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 20:53:45,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:53:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 456 proven. 54 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-02-05 20:53:45,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:53:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 20:53:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556939383] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:53:45,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 20:53:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 20 [2025-02-05 20:53:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589942870] [2025-02-05 20:53:45,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 20:53:45,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-05 20:53:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:45,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-05 20:53:45,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:53:45,996 INFO L87 Difference]: Start difference. First operand 207 states and 303 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 6 states have call predecessors, (59), 6 states have call successors, (59) [2025-02-05 20:53:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:46,395 INFO L93 Difference]: Finished difference Result 421 states and 611 transitions. [2025-02-05 20:53:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:53:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 6 states have call predecessors, (59), 6 states have call successors, (59) Word has length 144 [2025-02-05 20:53:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:46,398 INFO L225 Difference]: With dead ends: 421 [2025-02-05 20:53:46,398 INFO L226 Difference]: Without dead ends: 217 [2025-02-05 20:53:46,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2025-02-05 20:53:46,399 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 323 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:46,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 431 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:53:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-05 20:53:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2025-02-05 20:53:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 184 states have internal predecessors, (249), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 20:53:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2025-02-05 20:53:46,418 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 144 [2025-02-05 20:53:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:46,418 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2025-02-05 20:53:46,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 6 states have call successors, (57), 3 states have call predecessors, (57), 5 states have return successors, (59), 6 states have call predecessors, (59), 6 states have call successors, (59) [2025-02-05 20:53:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2025-02-05 20:53:46,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:53:46,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:46,422 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:46,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 20:53:46,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:46,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:46,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash -172634120, now seen corresponding path program 1 times [2025-02-05 20:53:46,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:46,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568762677] [2025-02-05 20:53:46,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:46,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:46,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:46,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:46,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:46,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 20:53:47,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:47,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568762677] [2025-02-05 20:53:47,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568762677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:47,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276850421] [2025-02-05 20:53:47,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:47,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:47,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:47,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:53:47,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 20:53:47,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:47,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:47,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:47,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:47,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 20:53:47,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:53:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:53:47,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:53:47,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276850421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:53:47,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:53:47,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 14 [2025-02-05 20:53:47,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225636389] [2025-02-05 20:53:47,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:47,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:53:47,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:47,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:53:47,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-05 20:53:47,600 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:47,801 INFO L93 Difference]: Finished difference Result 489 states and 683 transitions. [2025-02-05 20:53:47,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:53:47,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-02-05 20:53:47,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:47,805 INFO L225 Difference]: With dead ends: 489 [2025-02-05 20:53:47,805 INFO L226 Difference]: Without dead ends: 277 [2025-02-05 20:53:47,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:53:47,806 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 90 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:47,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 577 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:53:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-05 20:53:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 212. [2025-02-05 20:53:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 179 states have (on average 1.3798882681564246) internal successors, (247), 181 states have internal predecessors, (247), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 20:53:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 301 transitions. [2025-02-05 20:53:47,822 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 301 transitions. Word has length 144 [2025-02-05 20:53:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:47,822 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 301 transitions. [2025-02-05 20:53:47,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 301 transitions. [2025-02-05 20:53:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:53:47,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:47,824 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:47,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 20:53:48,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:48,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:48,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:48,025 INFO L85 PathProgramCache]: Analyzing trace with hash -313601457, now seen corresponding path program 1 times [2025-02-05 20:53:48,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489063758] [2025-02-05 20:53:48,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:48,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:48,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:48,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:48,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 20:53:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489063758] [2025-02-05 20:53:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489063758] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453941584] [2025-02-05 20:53:48,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:48,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:48,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:48,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:53:48,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 20:53:48,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:48,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:48,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:48,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:48,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 20:53:48,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:53:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:53:48,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:53:48,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453941584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:53:48,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 20:53:48,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 17 [2025-02-05 20:53:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634232494] [2025-02-05 20:53:48,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 20:53:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:48,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 20:53:48,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-02-05 20:53:48,950 INFO L87 Difference]: Start difference. First operand 212 states and 301 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:49,298 INFO L93 Difference]: Finished difference Result 543 states and 755 transitions. [2025-02-05 20:53:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:53:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-02-05 20:53:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:49,300 INFO L225 Difference]: With dead ends: 543 [2025-02-05 20:53:49,300 INFO L226 Difference]: Without dead ends: 338 [2025-02-05 20:53:49,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:53:49,301 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 166 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:49,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 476 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:53:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-05 20:53:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 210. [2025-02-05 20:53:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 177 states have (on average 1.3785310734463276) internal successors, (244), 179 states have internal predecessors, (244), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 20:53:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 298 transitions. [2025-02-05 20:53:49,315 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 298 transitions. Word has length 144 [2025-02-05 20:53:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:49,315 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 298 transitions. [2025-02-05 20:53:49,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 298 transitions. [2025-02-05 20:53:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 20:53:49,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:49,316 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:49,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 20:53:49,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-05 20:53:49,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:49,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash -683168297, now seen corresponding path program 1 times [2025-02-05 20:53:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:49,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814965349] [2025-02-05 20:53:49,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:49,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:49,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:49,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:49,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-02-05 20:53:50,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:50,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814965349] [2025-02-05 20:53:50,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814965349] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:50,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703651021] [2025-02-05 20:53:50,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:50,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:50,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:53:50,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 20:53:50,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 20:53:50,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 20:53:50,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:50,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:50,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 20:53:50,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:53:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 527 proven. 144 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-02-05 20:53:51,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:53:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:53:51,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703651021] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 20:53:51,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:53:51,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 20] total 29 [2025-02-05 20:53:51,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007879899] [2025-02-05 20:53:51,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:51,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:53:51,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:51,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:53:51,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2025-02-05 20:53:51,710 INFO L87 Difference]: Start difference. First operand 210 states and 298 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:52,044 INFO L93 Difference]: Finished difference Result 509 states and 711 transitions. [2025-02-05 20:53:52,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:53:52,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2025-02-05 20:53:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:52,048 INFO L225 Difference]: With dead ends: 509 [2025-02-05 20:53:52,048 INFO L226 Difference]: Without dead ends: 306 [2025-02-05 20:53:52,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2025-02-05 20:53:52,049 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 91 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:52,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 465 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:53:52,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-05 20:53:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 230. [2025-02-05 20:53:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 198 states have internal predecessors, (268), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 20:53:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 322 transitions. [2025-02-05 20:53:52,064 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 322 transitions. Word has length 144 [2025-02-05 20:53:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:52,064 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 322 transitions. [2025-02-05 20:53:52,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 322 transitions. [2025-02-05 20:53:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:53:52,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:52,065 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:52,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 20:53:52,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:52,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:52,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:52,266 INFO L85 PathProgramCache]: Analyzing trace with hash 291855533, now seen corresponding path program 1 times [2025-02-05 20:53:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:52,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040091497] [2025-02-05 20:53:52,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:52,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:53:52,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:53:52,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:52,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:53:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:52,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040091497] [2025-02-05 20:53:52,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040091497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:53:52,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:53:52,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 20:53:52,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767981352] [2025-02-05 20:53:52,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:52,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 20:53:52,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:52,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 20:53:52,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 20:53:52,328 INFO L87 Difference]: Start difference. First operand 230 states and 322 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:52,359 INFO L93 Difference]: Finished difference Result 525 states and 731 transitions. [2025-02-05 20:53:52,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 20:53:52,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2025-02-05 20:53:52,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:52,362 INFO L225 Difference]: With dead ends: 525 [2025-02-05 20:53:52,362 INFO L226 Difference]: Without dead ends: 298 [2025-02-05 20:53:52,364 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-02-05 20:53:52,365 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 44 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:52,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 214 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:53:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-05 20:53:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2025-02-05 20:53:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 241 states have (on average 1.3568464730290457) internal successors, (327), 243 states have internal predecessors, (327), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 20:53:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 381 transitions. [2025-02-05 20:53:52,379 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 381 transitions. Word has length 146 [2025-02-05 20:53:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:52,379 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 381 transitions. [2025-02-05 20:53:52,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 381 transitions. [2025-02-05 20:53:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:53:52,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:52,381 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:52,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:53:52,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:52,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash 514881519, now seen corresponding path program 1 times [2025-02-05 20:53:52,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:52,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684299116] [2025-02-05 20:53:52,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:52,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:53:52,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:53:52,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:52,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-05 20:53:52,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:53:52,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684299116] [2025-02-05 20:53:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684299116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:53:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:53:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 20:53:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564197052] [2025-02-05 20:53:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:52,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 20:53:52,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:53:52,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 20:53:52,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:53:52,958 INFO L87 Difference]: Start difference. First operand 275 states and 381 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:53,164 INFO L93 Difference]: Finished difference Result 667 states and 923 transitions. [2025-02-05 20:53:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 20:53:53,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2025-02-05 20:53:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:53,167 INFO L225 Difference]: With dead ends: 667 [2025-02-05 20:53:53,167 INFO L226 Difference]: Without dead ends: 395 [2025-02-05 20:53:53,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:53:53,168 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 31 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 20:53:53,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 416 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 20:53:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-05 20:53:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 351. [2025-02-05 20:53:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 317 states have (on average 1.3753943217665616) internal successors, (436), 319 states have internal predecessors, (436), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-05 20:53:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 490 transitions. [2025-02-05 20:53:53,184 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 490 transitions. Word has length 146 [2025-02-05 20:53:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:53,187 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 490 transitions. [2025-02-05 20:53:53,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-02-05 20:53:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 490 transitions. [2025-02-05 20:53:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 20:53:53,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:53,188 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:53,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:53:53,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:53,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1620407861, now seen corresponding path program 1 times [2025-02-05 20:53:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:53:53,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999522040] [2025-02-05 20:53:53,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:53,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:53:53,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:53:53,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:53:53,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:53,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 20:53:53,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397934208] [2025-02-05 20:53:53,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:53,256 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:53:53,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 20:53:53,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:53:53,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:53:53,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:53,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:53:53,349 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:53:53,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 20:53:53,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 20:53:53,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:53,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:53:53,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:53:53,457 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:53:53,458 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:53:53,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 20:53:53,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:53:53,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:53:53,740 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:53:53,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:53:53 BoogieIcfgContainer [2025-02-05 20:53:53,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:53:53,743 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:53:53,743 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:53:53,743 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:53:53,744 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:53:38" (3/4) ... [2025-02-05 20:53:53,745 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:53:53,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:53:53,746 INFO L158 Benchmark]: Toolchain (without parser) took 15993.33ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 105.6MB in the beginning and 198.1MB in the end (delta: -92.6MB). Peak memory consumption was 263.7MB. Max. memory is 16.1GB. [2025-02-05 20:53:53,746 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:53:53,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.02ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 91.9MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 20:53:53,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.53ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 88.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:53:53,747 INFO L158 Benchmark]: Boogie Preprocessor took 24.96ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 86.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:53:53,747 INFO L158 Benchmark]: IcfgBuilder took 357.11ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 65.7MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 20:53:53,747 INFO L158 Benchmark]: TraceAbstraction took 15332.17ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 64.7MB in the beginning and 198.3MB in the end (delta: -133.6MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. [2025-02-05 20:53:53,747 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 494.9MB. Free memory was 198.3MB in the beginning and 198.1MB in the end (delta: 157.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:53:53,748 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.13ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.02ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 91.9MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.53ms. Allocated memory is still 142.6MB. Free memory was 91.9MB in the beginning and 88.8MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.96ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 86.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 357.11ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 65.7MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15332.17ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 64.7MB in the beginning and 198.3MB in the end (delta: -133.6MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 494.9MB. Free memory was 198.3MB in the beginning and 198.1MB in the end (delta: 157.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed char var_1_2 = 100; [L24] signed short int var_1_3 = 1; [L25] signed long int var_1_4 = -16; [L26] signed long int var_1_5 = -64; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 5; [L29] double var_1_8 = 16.25; [L30] double var_1_9 = 1.8; [L31] unsigned char var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] unsigned short int var_1_12 = 16; [L34] unsigned long int var_1_13 = 128; [L35] unsigned char var_1_15 = 1; [L36] unsigned short int var_1_16 = 256; [L37] unsigned short int var_1_17 = 8; [L38] signed char var_1_18 = -2; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=100, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] FCALL updateLastVariables() [L133] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_3 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] var_1_5 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] var_1_6 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L103] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] var_1_7 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_8=65/4, var_1_9=9/5] [L106] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_8=65/4, var_1_9=9/5] [L107] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_8=65/4, var_1_9=9/5] [L107] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_8=65/4, var_1_9=9/5] [L108] var_1_8 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_9=9/5] [L109] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4, var_1_9=9/5] [L110] var_1_9 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L111] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L112] var_1_11 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L113] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L114] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L114] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L115] var_1_15 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L116] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L117] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L117] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L118] var_1_17 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L119] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L120] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L120] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L133] RET updateVariables() [L134] CALL step() [L42] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L42] signed long int stepLocal_1 = var_1_2 >> var_1_3; [L43] EXPR var_1_3 << (var_1_6 - var_1_7) VAL [isInitial=1, stepLocal_1=0, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L43] signed long int stepLocal_0 = var_1_3 << (var_1_6 - var_1_7); [L44] COND FALSE !(stepLocal_1 == (var_1_4 / var_1_5)) VAL [isInitial=1, stepLocal_0=0, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L51] signed char stepLocal_2 = var_1_6; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=7, var_1_10=32, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L52] COND TRUE stepLocal_2 <= (var_1_4 + var_1_7) [L53] var_1_10 = var_1_11 VAL [isInitial=1, stepLocal_0=0, var_1_10=260, var_1_11=260, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L57] COND TRUE ((var_1_6 >> 2) * var_1_10) > var_1_4 [L58] var_1_12 = var_1_6 VAL [isInitial=1, stepLocal_0=0, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L60] EXPR 1 << var_1_2 VAL [isInitial=1, stepLocal_0=0, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L60] COND TRUE (1 << var_1_2) != (-500 / -100) [L61] COND FALSE !((var_1_6 - var_1_3) >= (var_1_10 + 256)) [L64] var_1_13 = var_1_12 VAL [isInitial=1, stepLocal_0=0, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L69] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L70] unsigned short int stepLocal_3 = var_1_17; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=20, stepLocal_4=4, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=256, var_1_17=20, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L71] COND FALSE !((- var_1_9) <= var_1_8) [L84] var_1_16 = var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=20, stepLocal_4=4, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=-2, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L86] var_1_18 = var_1_3 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=20, stepLocal_4=4, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L125] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L125] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L125] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L125] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L125-L126] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_2) ? ((var_1_17 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] [L19] reach_error() VAL [isInitial=1, var_1_10=260, var_1_11=260, var_1_12=7, var_1_13=7, var_1_15=1, var_1_16=4, var_1_17=20, var_1_18=0, var_1_1=11/2, var_1_2=0, var_1_3=0, var_1_4=3, var_1_5=2, var_1_6=7, var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 11, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 958 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 950 mSDsluCounter, 4108 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2971 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2580 IncrementalHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 1137 mSDtfsCounter, 2580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1538 GetRequests, 1417 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=10, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 414 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2741 NumberOfCodeBlocks, 2741 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2861 ConstructedInterpolants, 0 QuantifiedInterpolants, 11173 SizeOfPredicates, 45 NumberOfNonLiveVariables, 2272 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 16406/16800 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-02-05 20:53:53,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:53:55,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:53:55,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 20:53:55,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:53:55,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:53:55,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:53:55,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:53:55,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:53:55,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:53:55,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:53:55,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:53:55,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:53:55,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:53:55,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:53:55,678 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:53:55,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:53:55,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:53:55,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:53:55,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:53:55,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:53:55,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:53:55,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:53:55,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:53:55,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:53:55,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:53:55,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:53:55,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:53:55,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:53:55,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:53:55,681 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:53:55,682 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:53:55,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:53:55,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:53:55,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:53:55,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:53:55,682 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-jdk21/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 -> a8e8864fbe413b3462ae8de456d5394de90101cbca5bf1017bcb2949274e710c [2025-02-05 20:53:55,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:53:55,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:53:55,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:53:55,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:53:55,931 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:53:55,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2025-02-05 20:53:57,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fbda1ccb/296997327cf2406a9d75c822d49065ed/FLAGf0e18f655 [2025-02-05 20:53:57,393 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:53:57,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i [2025-02-05 20:53:57,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fbda1ccb/296997327cf2406a9d75c822d49065ed/FLAGf0e18f655 [2025-02-05 20:53:57,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4fbda1ccb/296997327cf2406a9d75c822d49065ed [2025-02-05 20:53:57,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:53:57,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:53:57,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:53:57,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:53:57,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:53:57,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:57,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57, skipping insertion in model container [2025-02-05 20:53:57,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:57,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:53:57,865 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i[916,929] [2025-02-05 20:53:57,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:53:57,925 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:53:57,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-9.i[916,929] [2025-02-05 20:53:57,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:53:57,965 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:53:57,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57 WrapperNode [2025-02-05 20:53:57,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:53:57,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:53:57,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:53:57,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:53:57,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:57,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,002 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-02-05 20:53:58,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:53:58,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:53:58,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:53:58,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:53:58,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,035 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-02-05 20:53:58,039 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:53:58,061 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:53:58,064 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:53:58,065 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:53:58,065 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (1/1) ... [2025-02-05 20:53:58,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:53:58,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:53:58,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:53:58,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:53:58,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:53:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:53:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 20:53:58,136 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 20:53:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:53:58,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:53:58,202 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:53:58,204 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:53:58,584 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 20:53:58,584 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:53:58,596 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:53:58,596 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:53:58,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:53:58 BoogieIcfgContainer [2025-02-05 20:53:58,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:53:58,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:53:58,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:53:58,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:53:58,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:53:57" (1/3) ... [2025-02-05 20:53:58,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270511d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:53:58, skipping insertion in model container [2025-02-05 20:53:58,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:53:57" (2/3) ... [2025-02-05 20:53:58,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270511d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:53:58, skipping insertion in model container [2025-02-05 20:53:58,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:53:58" (3/3) ... [2025-02-05 20:53:58,605 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-9.i [2025-02-05 20:53:58,616 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:53:58,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-9.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:53:58,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:53:58,682 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;@2515c82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:53:58,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:53:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 20:53:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 20:53:58,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:58,697 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:58,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash -123024420, now seen corresponding path program 1 times [2025-02-05 20:53:58,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:53:58,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686698795] [2025-02-05 20:53:58,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:58,713 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-02-05 20:53:58,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:53:58,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 20:53:58,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:53:58,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 20:53:58,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 20:53:58,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:58,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:58,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 20:53:58,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:53:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-02-05 20:53:58,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:53:58,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:53:58,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686698795] [2025-02-05 20:53:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686698795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:53:58,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:53:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 20:53:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274864192] [2025-02-05 20:53:58,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:53:58,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 20:53:58,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:53:59,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 20:53:59,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 20:53:59,015 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 20:53:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:53:59,039 INFO L93 Difference]: Finished difference Result 120 states and 206 transitions. [2025-02-05 20:53:59,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 20:53:59,042 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2025-02-05 20:53:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:53:59,047 INFO L225 Difference]: With dead ends: 120 [2025-02-05 20:53:59,048 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 20:53:59,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-02-05 20:53:59,052 INFO L435 NwaCegarLoop]: 89 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, 89 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-02-05 20:53:59,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 20:53:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 20:53:59,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-05 20:53:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 20:53:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-02-05 20:53:59,089 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 133 [2025-02-05 20:53:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:53:59,089 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-02-05 20:53:59,090 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-05 20:53:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-02-05 20:53:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 20:53:59,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:53:59,092 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:53:59,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:53:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 20:53:59,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:53:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:53:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1528800834, now seen corresponding path program 1 times [2025-02-05 20:53:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:53:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577884205] [2025-02-05 20:53:59,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:53:59,296 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-02-05 20:53:59,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:53:59,298 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 20:53:59,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 20:53:59,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 20:53:59,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 20:53:59,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:53:59,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:53:59,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 20:53:59,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:54:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2025-02-05 20:54:00,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:54:00,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:54:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577884205] [2025-02-05 20:54:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577884205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:54:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2087618425] [2025-02-05 20:54:00,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:00,364 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 20:54:00,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 20:54:00,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 20:54:00,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-05 20:54:00,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 20:54:01,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 20:54:01,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:01,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:54:01,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 20:54:01,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:54:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 459 proven. 150 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-02-05 20:54:01,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:54:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2087618425] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 20:54:01,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:54:01,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 14 [2025-02-05 20:54:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316025722] [2025-02-05 20:54:01,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:54:01,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 20:54:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:54:01,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 20:54:01,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-02-05 20:54:01,731 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (31), 5 states have call predecessors, (31), 8 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2025-02-05 20:54:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:54:02,130 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2025-02-05 20:54:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:54:02,136 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (31), 5 states have call predecessors, (31), 8 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) Word has length 134 [2025-02-05 20:54:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:54:02,137 INFO L225 Difference]: With dead ends: 137 [2025-02-05 20:54:02,137 INFO L226 Difference]: Without dead ends: 80 [2025-02-05 20:54:02,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:54:02,138 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 33 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:54:02,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 179 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:54:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-05 20:54:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2025-02-05 20:54:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 21 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 20:54:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2025-02-05 20:54:02,148 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 134 [2025-02-05 20:54:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:54:02,149 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2025-02-05 20:54:02,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 13 states have internal predecessors, (66), 5 states have call successors, (31), 5 states have call predecessors, (31), 8 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2025-02-05 20:54:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2025-02-05 20:54:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 20:54:02,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:54:02,150 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 20:54:02,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-05 20:54:02,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-02-05 20:54:02,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 20:54:02,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:54:02,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:54:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1023356127, now seen corresponding path program 1 times [2025-02-05 20:54:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:54:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647952650] [2025-02-05 20:54:02,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:54:02,552 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-02-05 20:54:02,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 20:54:02,554 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-05 20:54:02,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 20:54:02,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 20:54:02,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 20:54:02,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:54:02,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:54:02,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 20:54:02,698 INFO L279 TraceCheckSpWp]: Computing forward predicates...