./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/loops-crafted-1/Mono1_1-2.c -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 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:53:37,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:53:37,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:53:37,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:53:37,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:53:37,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:53:37,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:53:37,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:53:37,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:53:37,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:53:37,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:53:37,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:53:37,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:53:37,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:53:37,796 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:53:37,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:53:37,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:53:37,796 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:53:37,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:53:37,797 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:53:37,798 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:53:37,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:53:37,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:53:37,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:53:37,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:53:37,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:53:37,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:53:37,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:53:37,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:53:37,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:53:37,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:53:37,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:53:37,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:53:37,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:53:37,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:53:37,799 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 -> 87992b509300f030a5da432e9377be19bc7547f7933c7234d13c36c34b6235c7 [2025-03-16 17:53:38,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:53:38,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:53:38,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:53:38,032 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:53:38,032 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:53:38,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2025-03-16 17:53:39,146 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed485d0a/2cbea41102fa4a0ea6f1f5d0ae693a30/FLAG83dc6ce01 [2025-03-16 17:53:39,382 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:53:39,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-2.c [2025-03-16 17:53:39,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed485d0a/2cbea41102fa4a0ea6f1f5d0ae693a30/FLAG83dc6ce01 [2025-03-16 17:53:39,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed485d0a/2cbea41102fa4a0ea6f1f5d0ae693a30 [2025-03-16 17:53:39,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:53:39,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:53:39,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:53:39,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:53:39,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:53:39,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8743e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39, skipping insertion in model container [2025-03-16 17:53:39,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:53:39,823 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/loops-crafted-1/Mono1_1-2.c[313,326] [2025-03-16 17:53:39,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:53:39,839 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:53:39,847 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/loops-crafted-1/Mono1_1-2.c[313,326] [2025-03-16 17:53:39,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:53:39,858 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:53:39,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39 WrapperNode [2025-03-16 17:53:39,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:53:39,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:53:39,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:53:39,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:53:39,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,881 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-03-16 17:53:39,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:53:39,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:53:39,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:53:39,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:53:39,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,894 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 17:53:39,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:53:39,903 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:53:39,903 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:53:39,904 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:53:39,905 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (1/1) ... [2025-03-16 17:53:39,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:53:39,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:53:39,928 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-16 17:53:39,930 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-16 17:53:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:53:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:53:39,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:53:39,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:53:39,977 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:53:39,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:53:40,041 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 17:53:40,041 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:53:40,046 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:53:40,046 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:53:40,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:53:40 BoogieIcfgContainer [2025-03-16 17:53:40,047 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:53:40,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:53:40,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:53:40,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:53:40,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:53:39" (1/3) ... [2025-03-16 17:53:40,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ecbf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:53:40, skipping insertion in model container [2025-03-16 17:53:40,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:53:39" (2/3) ... [2025-03-16 17:53:40,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ecbf44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:53:40, skipping insertion in model container [2025-03-16 17:53:40,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:53:40" (3/3) ... [2025-03-16 17:53:40,053 INFO L128 eAbstractionObserver]: Analyzing ICFG Mono1_1-2.c [2025-03-16 17:53:40,062 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:53:40,064 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Mono1_1-2.c that has 1 procedures, 9 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 17:53:40,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:53:40,100 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;@6ce7a2c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:53:40,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:53:40,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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-16 17:53:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 17:53:40,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:53:40,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 17:53:40,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:53:40,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:53:40,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1196540, now seen corresponding path program 1 times [2025-03-16 17:53:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:53:40,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155673219] [2025-03-16 17:53:40,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:53:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:53:40,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 17:53:40,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 17:53:40,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:53:40,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:40,240 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-16 17:53:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:53:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155673219] [2025-03-16 17:53:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155673219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:53:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:53:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:53:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010152521] [2025-03-16 17:53:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:53:40,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:53:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:53:40,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:53:40,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:53:40,256 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 17:53:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:53:40,280 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2025-03-16 17:53:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:53:40,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-16 17:53:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:53:40,285 INFO L225 Difference]: With dead ends: 19 [2025-03-16 17:53:40,285 INFO L226 Difference]: Without dead ends: 8 [2025-03-16 17:53:40,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:53:40,288 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:53:40,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:53:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-03-16 17:53:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-16 17:53:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-16 17:53:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-03-16 17:53:40,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 4 [2025-03-16 17:53:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:53:40,306 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-03-16 17:53:40,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-16 17:53:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-03-16 17:53:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:53:40,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:53:40,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:53:40,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:53:40,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:53:40,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:53:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1152737854, now seen corresponding path program 1 times [2025-03-16 17:53:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:53:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116341844] [2025-03-16 17:53:40,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:53:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:53:40,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:53:40,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:53:40,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:53:40,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:40,412 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-16 17:53:40,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:53:40,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116341844] [2025-03-16 17:53:40,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116341844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:53:40,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698344734] [2025-03-16 17:53:40,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:53:40,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:53:40,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:53:40,415 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-16 17:53:40,416 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-16 17:53:40,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:53:40,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:53:40,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:53:40,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:40,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 17:53:40,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:53:40,472 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-16 17:53:40,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:53:40,506 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-16 17:53:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698344734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:53:40,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:53:40,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-16 17:53:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815603223] [2025-03-16 17:53:40,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:53:40,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:53:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:53:40,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:53:40,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:53:40,508 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-16 17:53:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:53:40,550 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2025-03-16 17:53:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:53:40,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 6 [2025-03-16 17:53:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:53:40,551 INFO L225 Difference]: With dead ends: 17 [2025-03-16 17:53:40,551 INFO L226 Difference]: Without dead ends: 12 [2025-03-16 17:53:40,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:53:40,552 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:53:40,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:53:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-16 17:53:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-16 17:53:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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-16 17:53:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2025-03-16 17:53:40,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2025-03-16 17:53:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:53:40,554 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2025-03-16 17:53:40,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-16 17:53:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2025-03-16 17:53:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 17:53:40,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:53:40,555 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-16 17:53:40,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 17:53:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:53:40,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:53:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:53:40,759 INFO L85 PathProgramCache]: Analyzing trace with hash -288940639, now seen corresponding path program 1 times [2025-03-16 17:53:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:53:40,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969228022] [2025-03-16 17:53:40,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:53:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:53:40,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:53:40,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:53:40,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:53:40,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:53:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:53:40,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969228022] [2025-03-16 17:53:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969228022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:53:40,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362031947] [2025-03-16 17:53:40,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:53:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:53:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:53:40,878 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-16 17:53:40,880 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-16 17:53:40,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 17:53:40,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 17:53:40,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:53:40,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:40,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 17:53:40,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:53:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:53:40,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:53:41,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:53:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362031947] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:53:41,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:53:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 9 [2025-03-16 17:53:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091936015] [2025-03-16 17:53:41,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:53:41,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 17:53:41,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:53:41,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 17:53:41,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-03-16 17:53:41,041 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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-16 17:53:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:53:41,128 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-16 17:53:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:53:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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-16 17:53:41,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:53:41,129 INFO L225 Difference]: With dead ends: 25 [2025-03-16 17:53:41,129 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 17:53:41,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-16 17:53:41,129 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:53:41,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:53:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 17:53:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-16 17:53:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-16 17:53:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2025-03-16 17:53:41,133 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 10 [2025-03-16 17:53:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:53:41,133 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2025-03-16 17:53:41,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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-16 17:53:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2025-03-16 17:53:41,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 17:53:41,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:53:41,134 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2025-03-16 17:53:41,140 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-16 17:53:41,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-16 17:53:41,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:53:41,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:53:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1711359401, now seen corresponding path program 2 times [2025-03-16 17:53:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:53:41,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836191788] [2025-03-16 17:53:41,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:53:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:53:41,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-16 17:53:41,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:53:41,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:53:41,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:53:41,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:53:41,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836191788] [2025-03-16 17:53:41,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836191788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:53:41,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645695561] [2025-03-16 17:53:41,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:53:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:53:41,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:53:41,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:53:41,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 17:53:41,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-16 17:53:41,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 17:53:41,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:53:41,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:41,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 17:53:41,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:53:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:53:41,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:53:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:53:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645695561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:53:41,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:53:41,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-16 17:53:41,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125824678] [2025-03-16 17:53:41,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:53:41,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 17:53:41,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:53:41,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 17:53:41,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-03-16 17:53:41,710 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 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-16 17:53:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:53:42,051 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-03-16 17:53:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 17:53:42,051 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 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 18 [2025-03-16 17:53:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:53:42,052 INFO L225 Difference]: With dead ends: 37 [2025-03-16 17:53:42,052 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 17:53:42,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2025-03-16 17:53:42,053 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:53:42,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:53:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 17:53:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 17:53:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 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-16 17:53:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2025-03-16 17:53:42,060 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 18 [2025-03-16 17:53:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:53:42,060 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2025-03-16 17:53:42,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 18 states have internal predecessors, (36), 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-16 17:53:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2025-03-16 17:53:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 17:53:42,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:53:42,061 INFO L218 NwaCegarLoop]: trace histogram [13, 8, 5, 1, 1, 1, 1] [2025-03-16 17:53:42,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:53:42,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:53:42,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:53:42,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:53:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1381211825, now seen corresponding path program 3 times [2025-03-16 17:53:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:53:42,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945092847] [2025-03-16 17:53:42,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:53:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:53:42,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 14 equivalence classes. [2025-03-16 17:53:42,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 26 of 30 statements. [2025-03-16 17:53:42,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-16 17:53:42,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 88 proven. 25 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 17:53:42,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:53:42,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945092847] [2025-03-16 17:53:42,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945092847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:53:42,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227400453] [2025-03-16 17:53:42,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:53:42,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:53:42,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:53:42,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:53:42,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 17:53:42,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 14 equivalence classes. [2025-03-16 17:53:42,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 26 of 30 statements. [2025-03-16 17:53:42,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-16 17:53:42,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:53:42,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 17:53:42,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:53:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 88 proven. 25 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 17:53:42,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:53:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 88 proven. 25 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 17:53:42,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227400453] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:53:42,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:53:42,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2025-03-16 17:53:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698998679] [2025-03-16 17:53:42,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:53:42,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 17:53:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:53:42,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 17:53:42,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-16 17:53:42,784 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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-16 17:53:46,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:53:50,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:53:54,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:53:58,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:02,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:06,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:10,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:14,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:18,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:22,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:26,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:31,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:35,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:39,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:43,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:47,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:51,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:55,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:54:59,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:55:03,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 17:55:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:55:04,250 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2025-03-16 17:55:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-16 17:55:04,251 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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 30 [2025-03-16 17:55:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:55:04,252 INFO L225 Difference]: With dead ends: 79 [2025-03-16 17:55:04,252 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 17:55:04,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=467, Invalid=793, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 17:55:04,253 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 28 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:55:04,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 329 Invalid, 20 Unknown, 0 Unchecked, 80.4s Time] [2025-03-16 17:55:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 17:55:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2025-03-16 17:55:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-16 17:55:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-03-16 17:55:04,267 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 30 [2025-03-16 17:55:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:55:04,267 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-16 17:55:04,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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-16 17:55:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2025-03-16 17:55:04,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 17:55:04,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:55:04,269 INFO L218 NwaCegarLoop]: trace histogram [20, 12, 8, 1, 1, 1, 1] [2025-03-16 17:55:04,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:55:04,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:55:04,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:55:04,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:55:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1110145768, now seen corresponding path program 4 times [2025-03-16 17:55:04,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:55:04,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932360137] [2025-03-16 17:55:04,473 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:55:04,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:55:04,477 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-16 17:55:04,486 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 17:55:04,486 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:55:04,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 72 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-16 17:55:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:55:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932360137] [2025-03-16 17:55:04,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932360137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:55:04,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805423870] [2025-03-16 17:55:04,688 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:55:04,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:55:04,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:55:04,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:55:04,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 17:55:04,714 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-16 17:55:04,728 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 17:55:04,728 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:55:04,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:04,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 17:55:04,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:55:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:55:04,936 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:55:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 57 proven. 342 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:55:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805423870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:55:06,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:55:06,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 20, 21] total 41 [2025-03-16 17:55:06,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404806767] [2025-03-16 17:55:06,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:55:06,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-16 17:55:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:55:06,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-16 17:55:06,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1231, Unknown=0, NotChecked=0, Total=1722 [2025-03-16 17:55:06,016 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 41 states have internal predecessors, (86), 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)