./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_2+newton_3_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_2+newton_3_7.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 803cbc2ab2fb54f2ccf794a1cf55b1df2243f22f996d0e59d0f49967facf7958 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:54:12,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:54:12,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:54:12,542 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:54:12,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:54:12,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:54:12,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:54:12,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:54:12,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:54:12,563 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:54:12,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:54:12,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:54:12,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:54:12,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:54:12,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:54:12,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:54:12,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:54:12,565 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 803cbc2ab2fb54f2ccf794a1cf55b1df2243f22f996d0e59d0f49967facf7958 [2025-03-03 15:54:12,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:54:12,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:54:12,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:54:12,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:54:12,805 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:54:12,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_2+newton_3_7.i [2025-03-03 15:54:13,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765119477/9e971ea21c784528bbb4733cb0f8397d/FLAG86a57426f [2025-03-03 15:54:14,188 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:54:14,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i [2025-03-03 15:54:14,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765119477/9e971ea21c784528bbb4733cb0f8397d/FLAG86a57426f [2025-03-03 15:54:14,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/765119477/9e971ea21c784528bbb4733cb0f8397d [2025-03-03 15:54:14,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:54:14,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:54:14,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:54:14,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:54:14,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:54:14,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e194ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14, skipping insertion in model container [2025-03-03 15:54:14,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:54:14,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i[1226,1239] [2025-03-03 15:54:14,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i[2862,2875] [2025-03-03 15:54:14,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:54:14,371 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:54:14,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i[1226,1239] [2025-03-03 15:54:14,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_2+newton_3_7.i[2862,2875] [2025-03-03 15:54:14,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:54:14,404 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:54:14,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14 WrapperNode [2025-03-03 15:54:14,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:54:14,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:54:14,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:54:14,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:54:14,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,434 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2025-03-03 15:54:14,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:54:14,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:54:14,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:54:14,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:54:14,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,455 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-03 15:54:14,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:54:14,462 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:54:14,462 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:54:14,462 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:54:14,463 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (1/1) ... [2025-03-03 15:54:14,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:54:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:54:14,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:54:14,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:54:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:54:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-03-03 15:54:14,511 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-03-03 15:54:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-03 15:54:14,511 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-03 15:54:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:54:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 15:54:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:54:14,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:54:14,556 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:54:14,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:54:14,739 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-03-03 15:54:14,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:54:14,751 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:54:14,751 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:54:14,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:54:14 BoogieIcfgContainer [2025-03-03 15:54:14,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:54:14,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:54:14,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:54:14,758 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:54:14,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:54:14" (1/3) ... [2025-03-03 15:54:14,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399866f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:54:14, skipping insertion in model container [2025-03-03 15:54:14,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:54:14" (2/3) ... [2025-03-03 15:54:14,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399866f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:54:14, skipping insertion in model container [2025-03-03 15:54:14,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:54:14" (3/3) ... [2025-03-03 15:54:14,761 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_7.i [2025-03-03 15:54:14,772 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:54:14,773 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_3_7.i that has 3 procedures, 39 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-03 15:54:14,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:54:14,832 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;@efb8c24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:54:14,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:54:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 30 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 15:54:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 15:54:14,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:54:14,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:54:14,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:54:14,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:54:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1476885447, now seen corresponding path program 1 times [2025-03-03 15:54:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:54:14,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283467764] [2025-03-03 15:54:14,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:54:14,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:54:14,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 15:54:14,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 15:54:14,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:54:14,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:54:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:54:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:54:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283467764] [2025-03-03 15:54:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283467764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:54:15,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:54:15,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:54:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301563516] [2025-03-03 15:54:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:54:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:54:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:54:15,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:54:15,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:54:15,098 INFO L87 Difference]: Start difference. First operand has 39 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 30 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:54:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:54:15,148 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2025-03-03 15:54:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:54:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 15:54:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:54:15,153 INFO L225 Difference]: With dead ends: 73 [2025-03-03 15:54:15,153 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 15:54:15,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:54:15,156 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:54:15,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 119 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:54:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 15:54:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-03-03 15:54:15,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 15:54:15,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-03 15:54:15,178 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 10 [2025-03-03 15:54:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:54:15,179 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-03 15:54:15,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:54:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-03 15:54:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 15:54:15,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:54:15,180 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:54:15,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:54:15,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:54:15,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:54:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1448256296, now seen corresponding path program 1 times [2025-03-03 15:54:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:54:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193700913] [2025-03-03 15:54:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:54:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:54:15,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 15:54:15,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 15:54:15,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:54:15,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:54:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:54:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:54:15,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193700913] [2025-03-03 15:54:15,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193700913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:54:15,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:54:15,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:54:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752214614] [2025-03-03 15:54:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:54:15,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:54:15,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:54:15,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:54:15,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:54:15,275 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:54:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:54:15,303 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-03-03 15:54:15,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:54:15,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-03 15:54:15,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:54:15,307 INFO L225 Difference]: With dead ends: 37 [2025-03-03 15:54:15,307 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 15:54:15,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:54:15,308 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:54:15,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:54:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 15:54:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 15:54:15,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 15:54:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-03 15:54:15,315 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 10 [2025-03-03 15:54:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:54:15,316 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-03 15:54:15,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:54:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-03 15:54:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 15:54:15,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:54:15,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:54:15,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:54:15,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:54:15,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:54:15,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1915734479, now seen corresponding path program 1 times [2025-03-03 15:54:15,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:54:15,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254962303] [2025-03-03 15:54:15,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:54:15,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:54:15,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 15:54:15,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 15:54:15,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:54:15,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:54:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:54:15,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:54:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254962303] [2025-03-03 15:54:15,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254962303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:54:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101545569] [2025-03-03 15:54:15,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:54:15,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:54:15,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:54:15,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:54:15,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:54:15,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 15:54:15,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 15:54:15,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:54:15,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:54:15,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 15:54:15,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:54:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:54:15,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:54:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:54:15,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101545569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:54:15,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:54:15,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-03 15:54:15,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747640492] [2025-03-03 15:54:15,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:54:15,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:54:15,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:54:15,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:54:15,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:54:15,698 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:54:15,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:54:15,763 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-03 15:54:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:54:15,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 15:54:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:54:15,764 INFO L225 Difference]: With dead ends: 38 [2025-03-03 15:54:15,764 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 15:54:15,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:54:15,764 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:54:15,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 177 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:54:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 15:54:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 15:54:15,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 15:54:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-03-03 15:54:15,770 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2025-03-03 15:54:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:54:15,770 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-03-03 15:54:15,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:54:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-03-03 15:54:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 15:54:15,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:54:15,771 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:54:15,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:54:15,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:54:15,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:54:15,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:54:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 772311032, now seen corresponding path program 2 times [2025-03-03 15:54:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:54:15,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133707514] [2025-03-03 15:54:15,976 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:54:15,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:54:15,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-03 15:54:16,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 15:54:16,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 15:54:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:54:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:54:16,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:54:16,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133707514] [2025-03-03 15:54:16,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133707514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:54:16,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396638896] [2025-03-03 15:54:16,390 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 15:54:16,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:54:16,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:54:16,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:54:16,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:54:16,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-03 15:54:16,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 15:54:16,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 15:54:16,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:54:16,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 15:54:16,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:54:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:54:28,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:54:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:54:33,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396638896] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:54:33,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:54:33,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 15:54:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765112835] [2025-03-03 15:54:33,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:54:33,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 15:54:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:54:33,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 15:54:33,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=318, Unknown=2, NotChecked=0, Total=380 [2025-03-03 15:54:33,293 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:54:38,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 15:54:49,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2025-03-03 15:54:53,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2025-03-03 15:54:59,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 15:55:03,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-03 15:55:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:55:04,983 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-03 15:55:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:55:04,983 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 15:55:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:55:04,983 INFO L225 Difference]: With dead ends: 46 [2025-03-03 15:55:04,984 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 15:55:04,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=94, Invalid=456, Unknown=2, NotChecked=0, Total=552 [2025-03-03 15:55:04,984 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:55:04,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 323 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 5 Unknown, 0 Unchecked, 22.6s Time] [2025-03-03 15:55:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 15:55:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 15:55:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 15:55:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-03 15:55:04,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 12 [2025-03-03 15:55:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:55:04,993 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-03 15:55:04,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:55:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-03 15:55:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 15:55:04,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:55:04,994 INFO L218 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:55:05,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:55:05,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 15:55:05,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:55:05,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:55:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1188431416, now seen corresponding path program 3 times [2025-03-03 15:55:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:55:05,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104631882] [2025-03-03 15:55:05,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 15:55:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:55:05,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-03-03 15:55:05,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 15:55:05,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 15:55:05,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat