./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/interleave_bits.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/bitvector/interleave_bits.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 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:42:47,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:42:47,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:42:47,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:42:47,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:42:47,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:42:47,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:42:47,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:42:47,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:42:47,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:42:47,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:42:47,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:42:47,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:42:47,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:42:47,864 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:42:47,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:42:47,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:42:47,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:42:47,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:42:47,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:42:47,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:42:47,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:42:47,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:42:47,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:42:47,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:42:47,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:42:47,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:42:47,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:42:47,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:42:47,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:42:47,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:42:47,867 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-03-03 09:42:48,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:42:48,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:42:48,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:42:48,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:42:48,099 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:42:48,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-03 09:42:49,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfd96b98/e9914be4bcbc4369ac01bf6a69bc0183/FLAG98e1c92c5 [2025-03-03 09:42:49,490 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:42:49,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-03 09:42:49,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfd96b98/e9914be4bcbc4369ac01bf6a69bc0183/FLAG98e1c92c5 [2025-03-03 09:42:49,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dfd96b98/e9914be4bcbc4369ac01bf6a69bc0183 [2025-03-03 09:42:49,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:42:49,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:42:49,508 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:42:49,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:42:49,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:42:49,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,512 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49, skipping insertion in model container [2025-03-03 09:42:49,512 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:42:49,621 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/bitvector/interleave_bits.i[1175,1188] [2025-03-03 09:42:49,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:42:49,652 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:42:49,658 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/bitvector/interleave_bits.i[1175,1188] [2025-03-03 09:42:49,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:42:49,677 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:42:49,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49 WrapperNode [2025-03-03 09:42:49,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:42:49,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:42:49,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:42:49,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:42:49,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,703 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 232 [2025-03-03 09:42:49,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:42:49,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:42:49,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:42:49,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:42:49,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,721 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-03 09:42:49,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:42:49,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:42:49,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:42:49,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:42:49,740 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (1/1) ... [2025-03-03 09:42:49,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:42:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:49,764 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 09:42:49,766 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 09:42:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:42:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:42:49,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:42:49,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:42:49,822 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:42:49,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:42:50,590 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-03-03 09:42:50,590 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:42:50,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:42:50,625 INFO L336 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-03 09:42:50,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:50 BoogieIcfgContainer [2025-03-03 09:42:50,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:42:50,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:42:50,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:42:50,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:42:50,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:42:49" (1/3) ... [2025-03-03 09:42:50,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac4983a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:50, skipping insertion in model container [2025-03-03 09:42:50,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:42:49" (2/3) ... [2025-03-03 09:42:50,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac4983a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:42:50, skipping insertion in model container [2025-03-03 09:42:50,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:50" (3/3) ... [2025-03-03 09:42:50,634 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-03-03 09:42:50,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:42:50,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:42:50,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:42:50,693 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;@59cd2fa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:42:50,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:42:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.550561797752809) internal successors, (138), 90 states have internal predecessors, (138), 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 09:42:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:42:50,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:50,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:50,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:50,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:50,708 INFO L85 PathProgramCache]: Analyzing trace with hash -700491744, now seen corresponding path program 1 times [2025-03-03 09:42:50,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:50,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095494205] [2025-03-03 09:42:50,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:50,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:42:50,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:42:50,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:50,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:51,028 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 09:42:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:51,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095494205] [2025-03-03 09:42:51,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095494205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:51,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:51,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:42:51,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687858158] [2025-03-03 09:42:51,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:51,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:42:51,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:51,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:42:51,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:42:51,051 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.550561797752809) internal successors, (138), 90 states have internal predecessors, (138), 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 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 09:42:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:51,153 INFO L93 Difference]: Finished difference Result 199 states and 306 transitions. [2025-03-03 09:42:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:42:51,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 31 [2025-03-03 09:42:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:51,159 INFO L225 Difference]: With dead ends: 199 [2025-03-03 09:42:51,159 INFO L226 Difference]: Without dead ends: 106 [2025-03-03 09:42:51,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:42:51,164 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 27 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:51,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 204 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:51,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-03 09:42:51,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-03-03 09:42:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 93 states have internal predecessors, (142), 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 09:42:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 142 transitions. [2025-03-03 09:42:51,195 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 142 transitions. Word has length 31 [2025-03-03 09:42:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:51,196 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 142 transitions. [2025-03-03 09:42:51,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 09:42:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 142 transitions. [2025-03-03 09:42:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:42:51,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:51,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:51,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:42:51,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:51,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1047791467, now seen corresponding path program 1 times [2025-03-03 09:42:51,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068786820] [2025-03-03 09:42:51,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:51,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 09:42:51,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:42:51,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:51,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:51,390 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 09:42:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068786820] [2025-03-03 09:42:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068786820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974760659] [2025-03-03 09:42:51,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:51,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:51,393 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 09:42:51,395 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 09:42:51,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 09:42:51,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:42:51,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:51,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:51,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:42:51,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:51,510 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 09:42:51,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:51,556 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 09:42:51,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974760659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:51,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:42:51,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 09:42:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057709066] [2025-03-03 09:42:51,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:51,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:42:51,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:51,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:42:51,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:42:51,558 INFO L87 Difference]: Start difference. First operand 94 states and 142 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 09:42:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:51,726 INFO L93 Difference]: Finished difference Result 236 states and 364 transitions. [2025-03-03 09:42:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:42:51,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 41 [2025-03-03 09:42:51,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:51,728 INFO L225 Difference]: With dead ends: 236 [2025-03-03 09:42:51,729 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 09:42:51,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 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-03 09:42:51,730 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 157 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:51,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 498 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 09:42:51,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-03 09:42:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.52) internal successors, (228), 150 states have internal predecessors, (228), 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 09:42:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2025-03-03 09:42:51,738 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 41 [2025-03-03 09:42:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:51,738 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2025-03-03 09:42:51,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 09:42:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2025-03-03 09:42:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 09:42:51,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:51,739 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:51,747 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-03 09:42:51,945 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-03 09:42:51,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash 964484868, now seen corresponding path program 1 times [2025-03-03 09:42:51,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145168563] [2025-03-03 09:42:51,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:51,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:51,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 09:42:52,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 09:42:52,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:52,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:42:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145168563] [2025-03-03 09:42:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145168563] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208112992] [2025-03-03 09:42:52,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:52,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:52,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:52,172 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 09:42:52,173 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 09:42:52,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 09:42:52,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 09:42:52,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:52,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:52,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:42:52,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:42:52,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:42:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208112992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:52,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:42:52,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 09:42:52,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38459071] [2025-03-03 09:42:52,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:52,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:42:52,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:52,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:42:52,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:42:52,385 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 09:42:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:52,563 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2025-03-03 09:42:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:42:52,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 75 [2025-03-03 09:42:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:52,564 INFO L225 Difference]: With dead ends: 256 [2025-03-03 09:42:52,565 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 09:42:52,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:42:52,565 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 290 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:52,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 465 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 09:42:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-03 09:42:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 150 states have internal predecessors, (224), 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 09:42:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2025-03-03 09:42:52,574 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 224 transitions. Word has length 75 [2025-03-03 09:42:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:52,575 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 224 transitions. [2025-03-03 09:42:52,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 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 09:42:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 224 transitions. [2025-03-03 09:42:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 09:42:52,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:52,577 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:52,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:42:52,778 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-03 09:42:52,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:52,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:52,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1053237580, now seen corresponding path program 2 times [2025-03-03 09:42:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:52,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777589470] [2025-03-03 09:42:52,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:42:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:52,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-03 09:42:52,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 09:42:52,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:42:52,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:53,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777589470] [2025-03-03 09:42:53,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777589470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:53,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528993355] [2025-03-03 09:42:53,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:42:53,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:53,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:53,019 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-03 09:42:53,020 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-03 09:42:53,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 77 statements into 2 equivalence classes. [2025-03-03 09:42:53,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 09:42:53,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:42:53,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:53,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:42:53,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:53,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528993355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:53,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:42:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 09:42:53,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831908620] [2025-03-03 09:42:53,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:42:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:53,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:42:53,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:42:53,287 INFO L87 Difference]: Start difference. First operand 151 states and 224 transitions. Second operand has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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 09:42:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:53,714 INFO L93 Difference]: Finished difference Result 346 states and 518 transitions. [2025-03-03 09:42:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:42:53,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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 77 [2025-03-03 09:42:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:53,716 INFO L225 Difference]: With dead ends: 346 [2025-03-03 09:42:53,716 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 09:42:53,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:42:53,717 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 699 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:53,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1042 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:42:53,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 09:42:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-03 09:42:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.475177304964539) internal successors, (416), 282 states have internal predecessors, (416), 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 09:42:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 416 transitions. [2025-03-03 09:42:53,736 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 416 transitions. Word has length 77 [2025-03-03 09:42:53,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:53,737 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 416 transitions. [2025-03-03 09:42:53,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.76923076923077) internal successors, (127), 13 states have internal predecessors, (127), 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 09:42:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 416 transitions. [2025-03-03 09:42:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 09:42:53,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:53,739 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:53,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:42:53,946 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-03 09:42:53,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash 542884922, now seen corresponding path program 3 times [2025-03-03 09:42:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:53,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329699193] [2025-03-03 09:42:53,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:42:53,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:53,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 149 statements into 11 equivalence classes. [2025-03-03 09:42:53,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 43 of 149 statements. [2025-03-03 09:42:53,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:42:53,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:54,254 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-03 09:42:54,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:54,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329699193] [2025-03-03 09:42:54,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329699193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:54,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:54,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 09:42:54,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057767753] [2025-03-03 09:42:54,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:42:54,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:54,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:42:54,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:42:54,256 INFO L87 Difference]: Start difference. First operand 283 states and 416 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 09:42:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:54,483 INFO L93 Difference]: Finished difference Result 883 states and 1346 transitions. [2025-03-03 09:42:54,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:42:54,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 149 [2025-03-03 09:42:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:54,487 INFO L225 Difference]: With dead ends: 883 [2025-03-03 09:42:54,487 INFO L226 Difference]: Without dead ends: 611 [2025-03-03 09:42:54,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:42:54,489 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 108 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:54,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 909 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:42:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-03 09:42:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 604. [2025-03-03 09:42:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 1.4378109452736318) internal successors, (867), 603 states have internal predecessors, (867), 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 09:42:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 867 transitions. [2025-03-03 09:42:54,514 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 867 transitions. Word has length 149 [2025-03-03 09:42:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:54,515 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 867 transitions. [2025-03-03 09:42:54,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 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 09:42:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 867 transitions. [2025-03-03 09:42:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 09:42:54,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:54,517 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:42:54,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash 102013326, now seen corresponding path program 1 times [2025-03-03 09:42:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233827440] [2025-03-03 09:42:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:54,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 09:42:54,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 09:42:54,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:54,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-03 09:42:54,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233827440] [2025-03-03 09:42:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233827440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:42:54,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:42:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:42:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10118429] [2025-03-03 09:42:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:54,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:42:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:54,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:42:54,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:42:54,727 INFO L87 Difference]: Start difference. First operand 604 states and 867 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 09:42:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:54,795 INFO L93 Difference]: Finished difference Result 1390 states and 2019 transitions. [2025-03-03 09:42:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:42:54,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 150 [2025-03-03 09:42:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:54,799 INFO L225 Difference]: With dead ends: 1390 [2025-03-03 09:42:54,799 INFO L226 Difference]: Without dead ends: 812 [2025-03-03 09:42:54,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 09:42:54,802 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 7 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:54,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 309 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-03-03 09:42:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2025-03-03 09:42:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.3958076448828607) internal successors, (1132), 811 states have internal predecessors, (1132), 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 09:42:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1132 transitions. [2025-03-03 09:42:54,832 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1132 transitions. Word has length 150 [2025-03-03 09:42:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1132 transitions. [2025-03-03 09:42:54,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 09:42:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1132 transitions. [2025-03-03 09:42:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 09:42:54,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:54,835 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:54,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:42:54,836 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:54,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash -145054317, now seen corresponding path program 1 times [2025-03-03 09:42:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:54,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862199838] [2025-03-03 09:42:54,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:54,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 09:42:54,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 09:42:54,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:54,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:55,234 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:55,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862199838] [2025-03-03 09:42:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862199838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:55,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513277777] [2025-03-03 09:42:55,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:55,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:55,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:55,237 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-03 09:42:55,239 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-03 09:42:55,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 09:42:55,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 09:42:55,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:55,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:55,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:42:55,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 09:42:55,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-03 09:42:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513277777] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:42:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13, 6] total 17 [2025-03-03 09:42:55,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553460687] [2025-03-03 09:42:55,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:55,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:42:55,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:55,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:42:55,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:42:55,392 INFO L87 Difference]: Start difference. First operand 812 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 09:42:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:55,442 INFO L93 Difference]: Finished difference Result 823 states and 1147 transitions. [2025-03-03 09:42:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:42:55,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 150 [2025-03-03 09:42:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:55,445 INFO L225 Difference]: With dead ends: 823 [2025-03-03 09:42:55,445 INFO L226 Difference]: Without dead ends: 815 [2025-03-03 09:42:55,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:42:55,448 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:55,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 205 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:42:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-03 09:42:55,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2025-03-03 09:42:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 814 states have (on average 1.3968058968058967) internal successors, (1137), 814 states have internal predecessors, (1137), 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 09:42:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1137 transitions. [2025-03-03 09:42:55,466 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1137 transitions. Word has length 150 [2025-03-03 09:42:55,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:55,466 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1137 transitions. [2025-03-03 09:42:55,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 09:42:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1137 transitions. [2025-03-03 09:42:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 09:42:55,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:55,469 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:55,476 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-03 09:42:55,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:55,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:55,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:55,676 INFO L85 PathProgramCache]: Analyzing trace with hash -345757458, now seen corresponding path program 1 times [2025-03-03 09:42:55,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:55,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894885283] [2025-03-03 09:42:55,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:55,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:55,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 09:42:55,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 09:42:55,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:55,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:56,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:56,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894885283] [2025-03-03 09:42:56,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894885283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:56,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962912834] [2025-03-03 09:42:56,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:56,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:56,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:56,014 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-03 09:42:56,015 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-03 09:42:56,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 09:42:56,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 09:42:56,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:56,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:56,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:42:56,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 09:42:56,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-03 09:42:56,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962912834] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:56,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:42:56,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2025-03-03 09:42:56,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416631200] [2025-03-03 09:42:56,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:56,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:42:56,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:56,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:42:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:42:56,200 INFO L87 Difference]: Start difference. First operand 815 states and 1137 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 09:42:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:56,281 INFO L93 Difference]: Finished difference Result 883 states and 1239 transitions. [2025-03-03 09:42:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:42:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 150 [2025-03-03 09:42:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:56,284 INFO L225 Difference]: With dead ends: 883 [2025-03-03 09:42:56,284 INFO L226 Difference]: Without dead ends: 874 [2025-03-03 09:42:56,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:42:56,285 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 32 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:56,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 292 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-03 09:42:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-03-03 09:42:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.4054982817869415) internal successors, (1227), 873 states have internal predecessors, (1227), 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 09:42:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1227 transitions. [2025-03-03 09:42:56,310 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1227 transitions. Word has length 150 [2025-03-03 09:42:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:56,311 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1227 transitions. [2025-03-03 09:42:56,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 09:42:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1227 transitions. [2025-03-03 09:42:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 09:42:56,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:56,313 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:56,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:42:56,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:56,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:56,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash 798402832, now seen corresponding path program 1 times [2025-03-03 09:42:56,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:56,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658196898] [2025-03-03 09:42:56,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:56,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:56,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 09:42:56,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 09:42:56,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:56,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-03 09:42:56,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:56,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658196898] [2025-03-03 09:42:56,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658196898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:56,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231128129] [2025-03-03 09:42:56,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:56,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:56,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:56,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:42:56,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:42:56,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 09:42:56,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 09:42:56,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:56,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:56,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:42:56,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 46 proven. 102 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-03 09:42:56,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 139 proven. 9 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-03-03 09:42:57,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231128129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:57,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:42:57,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2025-03-03 09:42:57,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734157462] [2025-03-03 09:42:57,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:57,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:42:57,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:57,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:42:57,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:42:57,198 INFO L87 Difference]: Start difference. First operand 874 states and 1227 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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 09:42:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:57,360 INFO L93 Difference]: Finished difference Result 2060 states and 2861 transitions. [2025-03-03 09:42:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:42:57,361 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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 150 [2025-03-03 09:42:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:57,365 INFO L225 Difference]: With dead ends: 2060 [2025-03-03 09:42:57,366 INFO L226 Difference]: Without dead ends: 1285 [2025-03-03 09:42:57,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:42:57,369 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 92 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:57,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 610 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:57,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-03-03 09:42:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2025-03-03 09:42:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.3450155763239875) internal successors, (1727), 1284 states have internal predecessors, (1727), 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 09:42:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1727 transitions. [2025-03-03 09:42:57,391 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1727 transitions. Word has length 150 [2025-03-03 09:42:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:57,391 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1727 transitions. [2025-03-03 09:42:57,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 11 states have internal predecessors, (76), 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 09:42:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1727 transitions. [2025-03-03 09:42:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 09:42:57,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:57,394 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:57,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:42:57,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:57,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:57,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:57,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1714677952, now seen corresponding path program 1 times [2025-03-03 09:42:57,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:57,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605162295] [2025-03-03 09:42:57,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:57,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:57,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 09:42:57,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 09:42:57,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:57,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:57,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605162295] [2025-03-03 09:42:57,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605162295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991127400] [2025-03-03 09:42:57,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:57,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:57,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:57,880 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:42:57,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:42:57,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 09:42:57,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 09:42:57,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:57,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:57,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:42:57,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:57,991 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 09:42:57,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-03 09:42:58,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991127400] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:58,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:42:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-03-03 09:42:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454443277] [2025-03-03 09:42:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:58,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:42:58,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:58,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:42:58,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:42:58,052 INFO L87 Difference]: Start difference. First operand 1285 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 09:42:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:58,201 INFO L93 Difference]: Finished difference Result 1328 states and 1787 transitions. [2025-03-03 09:42:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:42:58,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 151 [2025-03-03 09:42:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:58,205 INFO L225 Difference]: With dead ends: 1328 [2025-03-03 09:42:58,205 INFO L226 Difference]: Without dead ends: 1300 [2025-03-03 09:42:58,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:42:58,206 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:58,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 382 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:42:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2025-03-03 09:42:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1300. [2025-03-03 09:42:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 1.342571208622017) internal successors, (1744), 1299 states have internal predecessors, (1744), 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 09:42:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1744 transitions. [2025-03-03 09:42:58,226 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1744 transitions. Word has length 151 [2025-03-03 09:42:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:58,226 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 1744 transitions. [2025-03-03 09:42:58,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 09:42:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1744 transitions. [2025-03-03 09:42:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 09:42:58,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:58,228 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:58,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:42:58,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:58,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash 402067445, now seen corresponding path program 1 times [2025-03-03 09:42:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:58,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048115089] [2025-03-03 09:42:58,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:58,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:58,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 09:42:58,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 09:42:58,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:58,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:42:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048115089] [2025-03-03 09:42:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048115089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874650588] [2025-03-03 09:42:58,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:58,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:58,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:58,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:42:58,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:42:58,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 09:42:58,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 09:42:58,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:58,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:58,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 09:42:58,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 09:42:58,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-03 09:42:58,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874650588] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:58,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:42:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13, 6] total 17 [2025-03-03 09:42:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640365995] [2025-03-03 09:42:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:42:58,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:42:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:58,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:42:58,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:42:58,861 INFO L87 Difference]: Start difference. First operand 1300 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 09:42:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:58,910 INFO L93 Difference]: Finished difference Result 1380 states and 1864 transitions. [2025-03-03 09:42:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:42:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 151 [2025-03-03 09:42:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:58,914 INFO L225 Difference]: With dead ends: 1380 [2025-03-03 09:42:58,914 INFO L226 Difference]: Without dead ends: 1304 [2025-03-03 09:42:58,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:42:58,915 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:58,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 205 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:42:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2025-03-03 09:42:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2025-03-03 09:42:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 1.343054489639294) internal successors, (1750), 1303 states have internal predecessors, (1750), 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 09:42:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1750 transitions. [2025-03-03 09:42:58,935 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1750 transitions. Word has length 151 [2025-03-03 09:42:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:58,935 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1750 transitions. [2025-03-03 09:42:58,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 09:42:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1750 transitions. [2025-03-03 09:42:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 09:42:58,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:58,938 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:58,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:42:59,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 09:42:59,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:42:59,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:42:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1597993114, now seen corresponding path program 1 times [2025-03-03 09:42:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:42:59,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890869708] [2025-03-03 09:42:59,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:59,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:42:59,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 09:42:59,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 09:42:59,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:59,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 99 proven. 9 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-03 09:42:59,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:42:59,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890869708] [2025-03-03 09:42:59,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890869708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:42:59,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884630139] [2025-03-03 09:42:59,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:42:59,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:42:59,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:42:59,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:42:59,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:42:59,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 09:42:59,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 09:42:59,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:42:59,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:42:59,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 09:42:59,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:42:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 81 proven. 99 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-03 09:42:59,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:42:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 171 proven. 9 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-03 09:42:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884630139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:42:59,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:42:59,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 11 [2025-03-03 09:42:59,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132783237] [2025-03-03 09:42:59,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:42:59,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:42:59,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:42:59,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:42:59,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:42:59,714 INFO L87 Difference]: Start difference. First operand 1304 states and 1750 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 09:42:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:42:59,901 INFO L93 Difference]: Finished difference Result 2971 states and 3947 transitions. [2025-03-03 09:42:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:42:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 151 [2025-03-03 09:42:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:42:59,906 INFO L225 Difference]: With dead ends: 2971 [2025-03-03 09:42:59,906 INFO L226 Difference]: Without dead ends: 1753 [2025-03-03 09:42:59,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:42:59,909 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 71 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:42:59,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 764 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:42:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2025-03-03 09:42:59,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1753. [2025-03-03 09:42:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1752 states have (on average 1.3013698630136987) internal successors, (2280), 1752 states have internal predecessors, (2280), 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 09:42:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2280 transitions. [2025-03-03 09:42:59,939 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2280 transitions. Word has length 151 [2025-03-03 09:42:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:42:59,939 INFO L471 AbstractCegarLoop]: Abstraction has 1753 states and 2280 transitions. [2025-03-03 09:42:59,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 09:42:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2280 transitions. [2025-03-03 09:42:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 09:42:59,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:42:59,943 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:42:59,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:00,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:00,144 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:00,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 427282832, now seen corresponding path program 2 times [2025-03-03 09:43:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582311532] [2025-03-03 09:43:00,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:00,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-03 09:43:00,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 09:43:00,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:00,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:00,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582311532] [2025-03-03 09:43:00,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582311532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:00,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143980516] [2025-03-03 09:43:00,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:00,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:00,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:00,396 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:00,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:43:00,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-03 09:43:00,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 09:43:00,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:00,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:00,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:43:00,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-03-03 09:43:00,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143980516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:43:00,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2025-03-03 09:43:00,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017502421] [2025-03-03 09:43:00,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:00,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:00,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:43:00,523 INFO L87 Difference]: Start difference. First operand 1753 states and 2280 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 09:43:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:00,594 INFO L93 Difference]: Finished difference Result 2924 states and 3869 transitions. [2025-03-03 09:43:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 151 [2025-03-03 09:43:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:00,599 INFO L225 Difference]: With dead ends: 2924 [2025-03-03 09:43:00,599 INFO L226 Difference]: Without dead ends: 1755 [2025-03-03 09:43:00,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:43:00,601 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 18 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:00,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 211 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2025-03-03 09:43:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1755. [2025-03-03 09:43:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 1.3010262257696694) internal successors, (2282), 1754 states have internal predecessors, (2282), 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 09:43:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2282 transitions. [2025-03-03 09:43:00,629 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2282 transitions. Word has length 151 [2025-03-03 09:43:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:00,629 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2282 transitions. [2025-03-03 09:43:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 09:43:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2282 transitions. [2025-03-03 09:43:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 09:43:00,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:00,633 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:00,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:43:00,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:43:00,837 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:00,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash 850324759, now seen corresponding path program 1 times [2025-03-03 09:43:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:00,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393761341] [2025-03-03 09:43:00,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:00,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:00,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 09:43:00,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 09:43:00,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:00,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:01,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393761341] [2025-03-03 09:43:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393761341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85827516] [2025-03-03 09:43:01,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:01,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:01,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:43:01,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 09:43:01,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 09:43:01,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:01,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:01,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:43:01,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 09:43:01,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-03 09:43:01,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85827516] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:01,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:01,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13, 5] total 17 [2025-03-03 09:43:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763573805] [2025-03-03 09:43:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:01,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:01,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:01,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:43:01,197 INFO L87 Difference]: Start difference. First operand 1755 states and 2282 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 09:43:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:01,314 INFO L93 Difference]: Finished difference Result 1776 states and 2307 transitions. [2025-03-03 09:43:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:01,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 152 [2025-03-03 09:43:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:01,319 INFO L225 Difference]: With dead ends: 1776 [2025-03-03 09:43:01,319 INFO L226 Difference]: Without dead ends: 1749 [2025-03-03 09:43:01,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:43:01,320 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:01,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-03 09:43:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1749. [2025-03-03 09:43:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1748 states have (on average 1.299771167048055) internal successors, (2272), 1748 states have internal predecessors, (2272), 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 09:43:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2272 transitions. [2025-03-03 09:43:01,345 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2272 transitions. Word has length 152 [2025-03-03 09:43:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:01,345 INFO L471 AbstractCegarLoop]: Abstraction has 1749 states and 2272 transitions. [2025-03-03 09:43:01,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 09:43:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2272 transitions. [2025-03-03 09:43:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 09:43:01,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:01,348 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:01,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:43:01,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:43:01,549 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:01,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:01,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1074330685, now seen corresponding path program 1 times [2025-03-03 09:43:01,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:01,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-03-03 09:43:01,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:01,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 09:43:01,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 09:43:01,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:01,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:01,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:01,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587885377] [2025-03-03 09:43:01,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587885377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:01,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036076669] [2025-03-03 09:43:01,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:01,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:01,772 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:01,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:43:01,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 09:43:01,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 09:43:01,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:01,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:01,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:43:01,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 09:43:01,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2025-03-03 09:43:01,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036076669] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:01,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:01,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13, 6] total 19 [2025-03-03 09:43:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107737400] [2025-03-03 09:43:01,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:01,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:01,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:01,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:43:01,925 INFO L87 Difference]: Start difference. First operand 1749 states and 2272 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 09:43:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:02,018 INFO L93 Difference]: Finished difference Result 1903 states and 2499 transitions. [2025-03-03 09:43:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:02,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 152 [2025-03-03 09:43:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:02,022 INFO L225 Difference]: With dead ends: 1903 [2025-03-03 09:43:02,022 INFO L226 Difference]: Without dead ends: 1757 [2025-03-03 09:43:02,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:43:02,023 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:02,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 383 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:02,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2025-03-03 09:43:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1757. [2025-03-03 09:43:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1756 states have (on average 1.2995444191343963) internal successors, (2282), 1756 states have internal predecessors, (2282), 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 09:43:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2282 transitions. [2025-03-03 09:43:02,051 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2282 transitions. Word has length 152 [2025-03-03 09:43:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:02,051 INFO L471 AbstractCegarLoop]: Abstraction has 1757 states and 2282 transitions. [2025-03-03 09:43:02,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 09:43:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2282 transitions. [2025-03-03 09:43:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 09:43:02,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:02,054 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:02,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:02,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:43:02,255 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:02,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1967913310, now seen corresponding path program 1 times [2025-03-03 09:43:02,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:02,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961193581] [2025-03-03 09:43:02,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:02,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:02,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 09:43:02,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 09:43:02,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:02,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 0 proven. 533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:02,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961193581] [2025-03-03 09:43:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961193581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072723294] [2025-03-03 09:43:02,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:02,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:02,486 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:02,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:43:02,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 09:43:02,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 09:43:02,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:02,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:02,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 09:43:02,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 37 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:03,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 56 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:03,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072723294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:03,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 16] total 39 [2025-03-03 09:43:03,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004780709] [2025-03-03 09:43:03,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:03,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 09:43:03,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:03,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 09:43:03,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=1067, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 09:43:03,632 INFO L87 Difference]: Start difference. First operand 1757 states and 2282 transitions. Second operand has 39 states, 39 states have (on average 10.025641025641026) internal successors, (391), 39 states have internal predecessors, (391), 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 09:43:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:13,994 INFO L93 Difference]: Finished difference Result 3429 states and 4501 transitions. [2025-03-03 09:43:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-03 09:43:13,994 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 10.025641025641026) internal successors, (391), 39 states have internal predecessors, (391), 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 152 [2025-03-03 09:43:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:14,000 INFO L225 Difference]: With dead ends: 3429 [2025-03-03 09:43:14,000 INFO L226 Difference]: Without dead ends: 3115 [2025-03-03 09:43:14,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2134, Invalid=4186, Unknown=0, NotChecked=0, Total=6320 [2025-03-03 09:43:14,002 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 2462 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 4799 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2462 SdHoareTripleChecker+Valid, 4423 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:14,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2462 Valid, 4423 Invalid, 4872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4799 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 09:43:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2025-03-03 09:43:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 2288. [2025-03-03 09:43:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 2287 states have (on average 1.2942719720157412) internal successors, (2960), 2287 states have internal predecessors, (2960), 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 09:43:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 2960 transitions. [2025-03-03 09:43:14,034 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 2960 transitions. Word has length 152 [2025-03-03 09:43:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:14,034 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 2960 transitions. [2025-03-03 09:43:14,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 10.025641025641026) internal successors, (391), 39 states have internal predecessors, (391), 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 09:43:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2960 transitions. [2025-03-03 09:43:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 09:43:14,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:14,038 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:14,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:43:14,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:43:14,238 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:14,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1957788059, now seen corresponding path program 2 times [2025-03-03 09:43:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849453087] [2025-03-03 09:43:14,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:14,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-03 09:43:14,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 09:43:14,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:14,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:14,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849453087] [2025-03-03 09:43:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849453087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326800387] [2025-03-03 09:43:14,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:14,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:14,545 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:14,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:43:14,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-03-03 09:43:14,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 09:43:14,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:14,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:43:14,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2025-03-03 09:43:14,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326800387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:14,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:43:14,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2025-03-03 09:43:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201598368] [2025-03-03 09:43:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:14,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:14,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:14,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:43:14,698 INFO L87 Difference]: Start difference. First operand 2288 states and 2960 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 09:43:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:14,799 INFO L93 Difference]: Finished difference Result 4209 states and 5584 transitions. [2025-03-03 09:43:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 188 [2025-03-03 09:43:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:14,805 INFO L225 Difference]: With dead ends: 4209 [2025-03-03 09:43:14,805 INFO L226 Difference]: Without dead ends: 2689 [2025-03-03 09:43:14,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:43:14,807 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 44 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:14,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 425 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:14,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2025-03-03 09:43:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2335. [2025-03-03 09:43:14,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2334 states have (on average 1.3084832904884318) internal successors, (3054), 2334 states have internal predecessors, (3054), 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 09:43:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3054 transitions. [2025-03-03 09:43:14,839 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3054 transitions. Word has length 188 [2025-03-03 09:43:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:14,839 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3054 transitions. [2025-03-03 09:43:14,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 09:43:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3054 transitions. [2025-03-03 09:43:14,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 09:43:14,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:14,842 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:14,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:15,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:15,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:15,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash -397703748, now seen corresponding path program 1 times [2025-03-03 09:43:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:15,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804287952] [2025-03-03 09:43:15,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:15,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 09:43:15,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 09:43:15,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:15,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:15,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804287952] [2025-03-03 09:43:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804287952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570633485] [2025-03-03 09:43:15,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:15,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:15,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:15,343 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:15,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:43:15,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 09:43:15,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 09:43:15,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:15,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:15,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:43:15,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2025-03-03 09:43:15,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-03-03 09:43:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570633485] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:15,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:15,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16, 6] total 22 [2025-03-03 09:43:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108904322] [2025-03-03 09:43:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:15,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:15,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:15,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:43:15,530 INFO L87 Difference]: Start difference. First operand 2335 states and 3054 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 09:43:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:15,643 INFO L93 Difference]: Finished difference Result 2419 states and 3172 transitions. [2025-03-03 09:43:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 189 [2025-03-03 09:43:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:15,648 INFO L225 Difference]: With dead ends: 2419 [2025-03-03 09:43:15,648 INFO L226 Difference]: Without dead ends: 2350 [2025-03-03 09:43:15,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:43:15,648 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:15,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 382 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:15,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-03-03 09:43:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2025-03-03 09:43:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 2349 states have (on average 1.3073648361004684) internal successors, (3071), 2349 states have internal predecessors, (3071), 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 09:43:15,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 3071 transitions. [2025-03-03 09:43:15,679 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 3071 transitions. Word has length 189 [2025-03-03 09:43:15,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:15,679 INFO L471 AbstractCegarLoop]: Abstraction has 2350 states and 3071 transitions. [2025-03-03 09:43:15,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 09:43:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 3071 transitions. [2025-03-03 09:43:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 09:43:15,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:15,683 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:15,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 09:43:15,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:43:15,883 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:15,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash -528498115, now seen corresponding path program 1 times [2025-03-03 09:43:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:15,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827798106] [2025-03-03 09:43:15,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:15,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 09:43:15,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 09:43:15,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:15,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:16,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827798106] [2025-03-03 09:43:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827798106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880758303] [2025-03-03 09:43:16,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:16,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:16,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:16,214 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:16,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:43:16,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-03 09:43:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-03 09:43:16,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:16,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:16,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:43:16,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:16,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880758303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:16,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:16,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2025-03-03 09:43:16,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814243754] [2025-03-03 09:43:16,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:16,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 09:43:16,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:16,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 09:43:16,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2025-03-03 09:43:16,782 INFO L87 Difference]: Start difference. First operand 2350 states and 3071 transitions. Second operand has 31 states, 31 states have (on average 11.193548387096774) internal successors, (347), 31 states have internal predecessors, (347), 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 09:43:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:17,565 INFO L93 Difference]: Finished difference Result 3204 states and 4250 transitions. [2025-03-03 09:43:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:43:17,565 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.193548387096774) internal successors, (347), 31 states have internal predecessors, (347), 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 189 [2025-03-03 09:43:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:17,571 INFO L225 Difference]: With dead ends: 3204 [2025-03-03 09:43:17,571 INFO L226 Difference]: Without dead ends: 2987 [2025-03-03 09:43:17,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:43:17,572 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1898 mSDsluCounter, 3833 mSDsCounter, 0 mSdLazyCounter, 3187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:17,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 4136 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3187 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:43:17,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2025-03-03 09:43:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2881. [2025-03-03 09:43:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 2880 states have (on average 1.3038194444444444) internal successors, (3755), 2880 states have internal predecessors, (3755), 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 09:43:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 3755 transitions. [2025-03-03 09:43:17,609 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 3755 transitions. Word has length 189 [2025-03-03 09:43:17,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:17,609 INFO L471 AbstractCegarLoop]: Abstraction has 2881 states and 3755 transitions. [2025-03-03 09:43:17,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.193548387096774) internal successors, (347), 31 states have internal predecessors, (347), 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 09:43:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 3755 transitions. [2025-03-03 09:43:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 09:43:17,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:17,613 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:17,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:17,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:17,818 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:17,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:17,818 INFO L85 PathProgramCache]: Analyzing trace with hash -159123084, now seen corresponding path program 2 times [2025-03-03 09:43:17,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:17,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613883405] [2025-03-03 09:43:17,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:17,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:17,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 225 statements into 2 equivalence classes. [2025-03-03 09:43:17,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 35 of 225 statements. [2025-03-03 09:43:17,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 09:43:17,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-03 09:43:17,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:17,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613883405] [2025-03-03 09:43:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613883405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:17,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:43:17,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68840863] [2025-03-03 09:43:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:17,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:17,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:17,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:17,867 INFO L87 Difference]: Start difference. First operand 2881 states and 3755 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 09:43:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:18,599 INFO L93 Difference]: Finished difference Result 3038 states and 3979 transitions. [2025-03-03 09:43:18,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:18,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 225 [2025-03-03 09:43:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:18,606 INFO L225 Difference]: With dead ends: 3038 [2025-03-03 09:43:18,606 INFO L226 Difference]: Without dead ends: 2879 [2025-03-03 09:43:18,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 09:43:18,607 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:18,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:43:18,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2025-03-03 09:43:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2879. [2025-03-03 09:43:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2879 states, 2878 states have (on average 1.3033356497567756) internal successors, (3751), 2878 states have internal predecessors, (3751), 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 09:43:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 3751 transitions. [2025-03-03 09:43:18,660 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 3751 transitions. Word has length 225 [2025-03-03 09:43:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:18,661 INFO L471 AbstractCegarLoop]: Abstraction has 2879 states and 3751 transitions. [2025-03-03 09:43:18,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 09:43:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 3751 transitions. [2025-03-03 09:43:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 09:43:18,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:18,666 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:18,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 09:43:18,666 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:18,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1719186364, now seen corresponding path program 2 times [2025-03-03 09:43:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591840542] [2025-03-03 09:43:18,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:18,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 225 statements into 2 equivalence classes. [2025-03-03 09:43:18,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 09:43:18,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:18,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2025-03-03 09:43:18,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:18,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591840542] [2025-03-03 09:43:18,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591840542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:18,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:18,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:43:18,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360178320] [2025-03-03 09:43:18,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:18,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:18,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:18,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:18,927 INFO L87 Difference]: Start difference. First operand 2879 states and 3751 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 09:43:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:19,087 INFO L93 Difference]: Finished difference Result 3094 states and 4065 transitions. [2025-03-03 09:43:19,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:19,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 225 [2025-03-03 09:43:19,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:19,092 INFO L225 Difference]: With dead ends: 3094 [2025-03-03 09:43:19,092 INFO L226 Difference]: Without dead ends: 2959 [2025-03-03 09:43:19,093 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 09:43:19,093 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 50 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:19,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 388 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-03-03 09:43:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2955. [2025-03-03 09:43:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2954 states have (on average 1.3070412999322951) internal successors, (3861), 2954 states have internal predecessors, (3861), 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 09:43:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3861 transitions. [2025-03-03 09:43:19,124 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3861 transitions. Word has length 225 [2025-03-03 09:43:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:19,124 INFO L471 AbstractCegarLoop]: Abstraction has 2955 states and 3861 transitions. [2025-03-03 09:43:19,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 09:43:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3861 transitions. [2025-03-03 09:43:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 09:43:19,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:19,128 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:19,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 09:43:19,128 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:19,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1909163361, now seen corresponding path program 1 times [2025-03-03 09:43:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:19,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339355083] [2025-03-03 09:43:19,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:19,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 09:43:19,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 09:43:19,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:19,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2025-03-03 09:43:19,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339355083] [2025-03-03 09:43:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339355083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:19,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 09:43:19,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580733491] [2025-03-03 09:43:19,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:19,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:43:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:19,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:43:19,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:43:19,492 INFO L87 Difference]: Start difference. First operand 2955 states and 3861 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 09:43:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:19,637 INFO L93 Difference]: Finished difference Result 5513 states and 7250 transitions. [2025-03-03 09:43:19,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:43:19,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 225 [2025-03-03 09:43:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:19,642 INFO L225 Difference]: With dead ends: 5513 [2025-03-03 09:43:19,642 INFO L226 Difference]: Without dead ends: 3205 [2025-03-03 09:43:19,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:43:19,645 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 48 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:19,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 460 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:19,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2025-03-03 09:43:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3047. [2025-03-03 09:43:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 3046 states have (on average 1.2882468811556138) internal successors, (3924), 3046 states have internal predecessors, (3924), 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 09:43:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 3924 transitions. [2025-03-03 09:43:19,693 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 3924 transitions. Word has length 225 [2025-03-03 09:43:19,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:19,693 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 3924 transitions. [2025-03-03 09:43:19,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 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 09:43:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 3924 transitions. [2025-03-03 09:43:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 09:43:19,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:19,697 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:19,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 09:43:19,697 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:19,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1303333547, now seen corresponding path program 1 times [2025-03-03 09:43:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:19,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129968247] [2025-03-03 09:43:19,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:19,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:19,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 09:43:19,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 09:43:19,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:19,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-03 09:43:19,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:19,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129968247] [2025-03-03 09:43:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129968247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:19,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:19,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:43:19,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062335936] [2025-03-03 09:43:19,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:19,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:19,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:19,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:19,837 INFO L87 Difference]: Start difference. First operand 3047 states and 3924 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 09:43:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:19,934 INFO L93 Difference]: Finished difference Result 3111 states and 4011 transitions. [2025-03-03 09:43:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:19,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 226 [2025-03-03 09:43:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:19,938 INFO L225 Difference]: With dead ends: 3111 [2025-03-03 09:43:19,938 INFO L226 Difference]: Without dead ends: 3041 [2025-03-03 09:43:19,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 09:43:19,939 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:19,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2025-03-03 09:43:19,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 3041. [2025-03-03 09:43:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3041 states, 3040 states have (on average 1.2875) internal successors, (3914), 3040 states have internal predecessors, (3914), 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 09:43:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3041 states to 3041 states and 3914 transitions. [2025-03-03 09:43:19,979 INFO L78 Accepts]: Start accepts. Automaton has 3041 states and 3914 transitions. Word has length 226 [2025-03-03 09:43:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:19,979 INFO L471 AbstractCegarLoop]: Abstraction has 3041 states and 3914 transitions. [2025-03-03 09:43:19,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 09:43:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3041 states and 3914 transitions. [2025-03-03 09:43:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 09:43:19,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:19,982 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:19,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 09:43:19,982 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash -482569110, now seen corresponding path program 1 times [2025-03-03 09:43:19,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:19,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330188889] [2025-03-03 09:43:19,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:19,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:19,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 09:43:20,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 09:43:20,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:20,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-03 09:43:20,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330188889] [2025-03-03 09:43:20,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330188889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:20,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:20,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:43:20,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635209560] [2025-03-03 09:43:20,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:20,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:20,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:20,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:20,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:43:20,183 INFO L87 Difference]: Start difference. First operand 3041 states and 3914 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 09:43:21,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 09:43:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:21,437 INFO L93 Difference]: Finished difference Result 3278 states and 4252 transitions. [2025-03-03 09:43:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:21,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 226 [2025-03-03 09:43:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:21,441 INFO L225 Difference]: With dead ends: 3278 [2025-03-03 09:43:21,441 INFO L226 Difference]: Without dead ends: 3053 [2025-03-03 09:43:21,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:43:21,441 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:21,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 09:43:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-03-03 09:43:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 3053. [2025-03-03 09:43:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3053 states, 3052 states have (on average 1.2863695937090434) internal successors, (3926), 3052 states have internal predecessors, (3926), 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 09:43:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 3926 transitions. [2025-03-03 09:43:21,485 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 3926 transitions. Word has length 226 [2025-03-03 09:43:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:21,486 INFO L471 AbstractCegarLoop]: Abstraction has 3053 states and 3926 transitions. [2025-03-03 09:43:21,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 09:43:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 3926 transitions. [2025-03-03 09:43:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 09:43:21,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:21,489 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:21,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 09:43:21,489 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:21,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1231348509, now seen corresponding path program 2 times [2025-03-03 09:43:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:21,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276276966] [2025-03-03 09:43:21,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:21,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 226 statements into 2 equivalence classes. [2025-03-03 09:43:21,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 09:43:21,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:21,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1382 trivial. 0 not checked. [2025-03-03 09:43:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:21,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276276966] [2025-03-03 09:43:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276276966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:21,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:21,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:43:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704476649] [2025-03-03 09:43:21,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:21,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:21,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:21,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:21,723 INFO L87 Difference]: Start difference. First operand 3053 states and 3926 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 09:43:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:22,477 INFO L93 Difference]: Finished difference Result 3347 states and 4347 transitions. [2025-03-03 09:43:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:22,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 226 [2025-03-03 09:43:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:22,480 INFO L225 Difference]: With dead ends: 3347 [2025-03-03 09:43:22,480 INFO L226 Difference]: Without dead ends: 3062 [2025-03-03 09:43:22,481 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 09:43:22,481 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:22,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 319 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:43:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2025-03-03 09:43:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3059. [2025-03-03 09:43:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3059 states, 3058 states have (on average 1.2851536952256377) internal successors, (3930), 3058 states have internal predecessors, (3930), 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 09:43:22,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3059 states to 3059 states and 3930 transitions. [2025-03-03 09:43:22,512 INFO L78 Accepts]: Start accepts. Automaton has 3059 states and 3930 transitions. Word has length 226 [2025-03-03 09:43:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:22,512 INFO L471 AbstractCegarLoop]: Abstraction has 3059 states and 3930 transitions. [2025-03-03 09:43:22,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 09:43:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3059 states and 3930 transitions. [2025-03-03 09:43:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 09:43:22,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:22,515 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:22,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 09:43:22,515 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:22,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -366670290, now seen corresponding path program 1 times [2025-03-03 09:43:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:22,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826457982] [2025-03-03 09:43:22,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:22,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 09:43:22,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 09:43:22,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:22,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-03 09:43:22,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:22,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826457982] [2025-03-03 09:43:22,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826457982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:22,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:22,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:43:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041876355] [2025-03-03 09:43:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:22,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:22,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:22,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:22,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:43:22,731 INFO L87 Difference]: Start difference. First operand 3059 states and 3930 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 09:43:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:22,881 INFO L93 Difference]: Finished difference Result 3180 states and 4099 transitions. [2025-03-03 09:43:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 227 [2025-03-03 09:43:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:22,886 INFO L225 Difference]: With dead ends: 3180 [2025-03-03 09:43:22,886 INFO L226 Difference]: Without dead ends: 3068 [2025-03-03 09:43:22,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:43:22,887 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:22,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2025-03-03 09:43:22,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2025-03-03 09:43:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3067 states have (on average 1.2836648190414086) internal successors, (3937), 3067 states have internal predecessors, (3937), 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 09:43:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 3937 transitions. [2025-03-03 09:43:22,934 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 3937 transitions. Word has length 227 [2025-03-03 09:43:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:22,934 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 3937 transitions. [2025-03-03 09:43:22,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 09:43:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 3937 transitions. [2025-03-03 09:43:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 09:43:22,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:22,938 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:22,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 09:43:22,938 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:22,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:22,939 INFO L85 PathProgramCache]: Analyzing trace with hash 552379875, now seen corresponding path program 1 times [2025-03-03 09:43:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358291657] [2025-03-03 09:43:22,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:22,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 09:43:22,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 09:43:22,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:22,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-03 09:43:23,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:23,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358291657] [2025-03-03 09:43:23,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358291657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:23,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:43:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014623348] [2025-03-03 09:43:23,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:23,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:23,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:23,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:23,046 INFO L87 Difference]: Start difference. First operand 3068 states and 3937 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 09:43:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:24,153 INFO L93 Difference]: Finished difference Result 3112 states and 3985 transitions. [2025-03-03 09:43:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:24,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 227 [2025-03-03 09:43:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:24,157 INFO L225 Difference]: With dead ends: 3112 [2025-03-03 09:43:24,157 INFO L226 Difference]: Without dead ends: 3072 [2025-03-03 09:43:24,157 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 09:43:24,158 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:24,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 271 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 09:43:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2025-03-03 09:43:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3071. [2025-03-03 09:43:24,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 3070 states have (on average 1.283387622149837) internal successors, (3940), 3070 states have internal predecessors, (3940), 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 09:43:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3940 transitions. [2025-03-03 09:43:24,192 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3940 transitions. Word has length 227 [2025-03-03 09:43:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:24,192 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 3940 transitions. [2025-03-03 09:43:24,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 09:43:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3940 transitions. [2025-03-03 09:43:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 09:43:24,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:24,196 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:24,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 09:43:24,196 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1823970063, now seen corresponding path program 1 times [2025-03-03 09:43:24,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:24,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542787312] [2025-03-03 09:43:24,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:24,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:24,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 09:43:24,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 09:43:24,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:24,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2025-03-03 09:43:24,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542787312] [2025-03-03 09:43:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542787312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:24,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:24,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:43:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127850546] [2025-03-03 09:43:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:24,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:24,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:24,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:43:24,390 INFO L87 Difference]: Start difference. First operand 3071 states and 3940 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 09:43:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:24,532 INFO L93 Difference]: Finished difference Result 3360 states and 4344 transitions. [2025-03-03 09:43:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:24,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 228 [2025-03-03 09:43:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:24,536 INFO L225 Difference]: With dead ends: 3360 [2025-03-03 09:43:24,536 INFO L226 Difference]: Without dead ends: 3083 [2025-03-03 09:43:24,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:43:24,537 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:24,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:24,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2025-03-03 09:43:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3083. [2025-03-03 09:43:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3082 states have (on average 1.282284231018819) internal successors, (3952), 3082 states have internal predecessors, (3952), 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 09:43:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3952 transitions. [2025-03-03 09:43:24,573 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3952 transitions. Word has length 228 [2025-03-03 09:43:24,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:24,573 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 3952 transitions. [2025-03-03 09:43:24,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 09:43:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3952 transitions. [2025-03-03 09:43:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 09:43:24,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:24,576 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:24,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 09:43:24,576 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:24,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2084462371, now seen corresponding path program 1 times [2025-03-03 09:43:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:24,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64917351] [2025-03-03 09:43:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:24,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 09:43:24,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 09:43:24,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:24,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 76 proven. 16 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2025-03-03 09:43:24,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64917351] [2025-03-03 09:43:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64917351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:24,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918859550] [2025-03-03 09:43:24,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:24,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:24,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:24,868 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:24,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:43:24,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 09:43:24,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 09:43:24,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:24,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:24,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:43:24,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-03 09:43:24,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918859550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:24,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:43:24,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-03 09:43:24,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570521217] [2025-03-03 09:43:24,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:24,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:43:24,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:24,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:43:24,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:43:24,998 INFO L87 Difference]: Start difference. First operand 3083 states and 3952 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 09:43:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:25,105 INFO L93 Difference]: Finished difference Result 3203 states and 4116 transitions. [2025-03-03 09:43:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:43:25,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 228 [2025-03-03 09:43:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:25,108 INFO L225 Difference]: With dead ends: 3203 [2025-03-03 09:43:25,108 INFO L226 Difference]: Without dead ends: 3099 [2025-03-03 09:43:25,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:43:25,109 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:25,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 382 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-03-03 09:43:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3095. [2025-03-03 09:43:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3095 states, 3094 states have (on average 1.2811893988364575) internal successors, (3964), 3094 states have internal predecessors, (3964), 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 09:43:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3095 states to 3095 states and 3964 transitions. [2025-03-03 09:43:25,145 INFO L78 Accepts]: Start accepts. Automaton has 3095 states and 3964 transitions. Word has length 228 [2025-03-03 09:43:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:25,146 INFO L471 AbstractCegarLoop]: Abstraction has 3095 states and 3964 transitions. [2025-03-03 09:43:25,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 09:43:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3095 states and 3964 transitions. [2025-03-03 09:43:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 09:43:25,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:25,149 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:25,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 09:43:25,350 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:25,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1948795039, now seen corresponding path program 1 times [2025-03-03 09:43:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:25,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224582453] [2025-03-03 09:43:25,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:25,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 09:43:25,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 09:43:25,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:25,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2025-03-03 09:43:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224582453] [2025-03-03 09:43:25,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224582453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:25,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:25,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:43:25,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959134144] [2025-03-03 09:43:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:25,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:43:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:25,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:43:25,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:43:25,492 INFO L87 Difference]: Start difference. First operand 3095 states and 3964 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 09:43:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:25,869 INFO L93 Difference]: Finished difference Result 3217 states and 4113 transitions. [2025-03-03 09:43:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:43:25,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 228 [2025-03-03 09:43:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:25,873 INFO L225 Difference]: With dead ends: 3217 [2025-03-03 09:43:25,873 INFO L226 Difference]: Without dead ends: 3096 [2025-03-03 09:43:25,873 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 09:43:25,874 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:25,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 269 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:43:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2025-03-03 09:43:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3096. [2025-03-03 09:43:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3096 states, 3095 states have (on average 1.2807754442649435) internal successors, (3964), 3095 states have internal predecessors, (3964), 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 09:43:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 3964 transitions. [2025-03-03 09:43:25,907 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 3964 transitions. Word has length 228 [2025-03-03 09:43:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:25,907 INFO L471 AbstractCegarLoop]: Abstraction has 3096 states and 3964 transitions. [2025-03-03 09:43:25,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 09:43:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 3964 transitions. [2025-03-03 09:43:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 09:43:25,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:25,911 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:25,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 09:43:25,911 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1018728088, now seen corresponding path program 1 times [2025-03-03 09:43:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858644799] [2025-03-03 09:43:25,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:25,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 09:43:25,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 09:43:25,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:25,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:43:25,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 09:43:25,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 09:43:26,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 09:43:26,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:26,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 09:43:26,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 09:43:26,097 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 09:43:26,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:43:26,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 09:43:26,101 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:26,160 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:43:26,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:43:26 BoogieIcfgContainer [2025-03-03 09:43:26,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:43:26,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:43:26,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:43:26,164 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:43:26,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:42:50" (3/4) ... [2025-03-03 09:43:26,166 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 09:43:26,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:43:26,167 INFO L158 Benchmark]: Toolchain (without parser) took 36659.53ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 113.0MB in the beginning and 234.9MB in the end (delta: -121.9MB). Peak memory consumption was 272.1MB. Max. memory is 16.1GB. [2025-03-03 09:43:26,167 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:26,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.01ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:43:26,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.68ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:43:26,168 INFO L158 Benchmark]: Boogie Preprocessor took 30.77ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:26,168 INFO L158 Benchmark]: IcfgBuilder took 891.00ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 67.2MB in the end (delta: 30.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:43:26,169 INFO L158 Benchmark]: TraceAbstraction took 35533.14ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 66.7MB in the beginning and 235.0MB in the end (delta: -168.2MB). Peak memory consumption was 230.1MB. Max. memory is 16.1GB. [2025-03-03 09:43:26,169 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 536.9MB. Free memory was 235.0MB in the beginning and 234.9MB in the end (delta: 108.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:26,170 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.01ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.6MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.68ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.77ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 891.00ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 67.2MB in the end (delta: 30.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35533.14ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 66.7MB in the beginning and 235.0MB in the end (delta: -168.2MB). Peak memory consumption was 230.1MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 536.9MB. Free memory was 235.0MB in the beginning and 234.9MB in the end (delta: 108.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of shiftLeft at line 50, overapproximation of bitwiseOr at line 59, overapproximation of bitwiseAnd at line 59. Possible FailurePath: [L42] unsigned short x = __VERIFIER_nondet_ushort(); [L43] unsigned short y = __VERIFIER_nondet_ushort(); [L44] unsigned int xx; [L45] unsigned int yy; [L46] unsigned int zz; [L47] unsigned int z = 0; [L48] unsigned int i = 0; VAL [i=0, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=0, z=0] [L50] EXPR 1U << i VAL [i=0, z=0] [L50] EXPR x & (1U << i) VAL [i=0, x=0, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=0, x=0, z=0] [L50] EXPR 1U << i VAL [i=0, x=0, z=0] [L50] EXPR y & (1U << i) VAL [i=0, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=0, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=0, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=1, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=1, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=1, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=1, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=1, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=1, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=1, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=2, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=2, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=2, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=2, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=2, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=2, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=2, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=3, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=3, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=3, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=3, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=3, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=3, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=3, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=4, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=4, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=4, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=4, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=4, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=4, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=4, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=5, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=5, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=5, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=5, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=5, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=5, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=5, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=6, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=6, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=6, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=6, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=6, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=6, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=6, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=7, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=7, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=7, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=7, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=7, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=7, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=7, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=8, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=8, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=8, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=8, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=8, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=8, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=8, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=9, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=9, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=9, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=9, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=9, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=9, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=9, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=10, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=10, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=10, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=10, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=10, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=10, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=10, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=11, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=11, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=11, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=11, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=11, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=11, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=11, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=12, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=12, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=12, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=12, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=12, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=12, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=12, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=13, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=13, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=13, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=13, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=13, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=13, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=13, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=14, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=14, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=14, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=14, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=14, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=14, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=14, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=15, x=0, y=1, z=0] [L49] COND TRUE i < sizeof(x) * 8 VAL [i=15, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR x & (1U << i) VAL [i=15, x=0, y=1, z=0] [L50] EXPR (x & (1U << i)) << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR 1U << i VAL [i=15, x=0, y=1, z=0] [L50] EXPR y & (1U << i) VAL [i=15, x=0, y=1, z=0] [L50] EXPR (y & (1U << i)) << (i + 1) VAL [i=15, x=0, y=1, z=0] [L50] EXPR ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) VAL [i=15, x=0, y=1, z=0] [L50] z |= ((x & (1U << i)) << i) | ((y & (1U << i)) << (i + 1)) [L51] i += 1U VAL [i=16, x=0, y=1, z=4294967297] [L49] COND FALSE !(i < sizeof(x) * 8) [L53] xx = x [L54] yy = y VAL [xx=0, yy=1, z=4294967297] [L55] EXPR xx | (xx << 8u) VAL [yy=1, z=4294967297] [L55] EXPR (xx | (xx << 8u)) & 16711935U VAL [yy=1, z=4294967297] [L55] xx = (xx | (xx << 8u)) & 16711935U [L56] EXPR xx | (xx << 4u) VAL [yy=1, z=4294967297] [L56] EXPR (xx | (xx << 4u)) & 252645135U VAL [yy=1, z=4294967297] [L56] xx = (xx | (xx << 4u)) & 252645135U [L57] EXPR xx | (xx << 2u) VAL [yy=1, z=4294967297] [L57] EXPR (xx | (xx << 2u)) & 858993459U VAL [yy=1, z=4294967297] [L57] xx = (xx | (xx << 2u)) & 858993459U [L58] EXPR xx | (xx << 1u) VAL [yy=1, z=4294967297] [L58] EXPR (xx | (xx << 1u)) & 1431655765U VAL [yy=1, z=4294967297] [L58] xx = (xx | (xx << 1u)) & 1431655765U [L59] EXPR yy | (yy << 8u) VAL [xx=0, z=4294967297] [L59] EXPR (yy | (yy << 8u)) & 16711935U VAL [xx=0, z=4294967297] [L59] yy = (yy | (yy << 8u)) & 16711935U [L60] EXPR yy | (yy << 4u) VAL [xx=0, z=4294967297] [L60] EXPR (yy | (yy << 4u)) & 252645135U VAL [xx=0, z=4294967297] [L60] yy = (yy | (yy << 4u)) & 252645135U [L61] EXPR yy | (yy << 2u) VAL [xx=0, z=4294967297] [L61] EXPR (yy | (yy << 2u)) & 858993459U VAL [xx=0, z=4294967297] [L61] yy = (yy | (yy << 2u)) & 858993459U [L62] EXPR yy | (yy << 1u) VAL [xx=0, z=4294967297] [L62] EXPR (yy | (yy << 1u)) & 1431655765U VAL [xx=0, z=4294967297] [L62] yy = (yy | (yy << 1u)) & 1431655765U [L64] EXPR xx | (yy << 1U) VAL [z=4294967297] [L64] zz = xx | (yy << 1U) [L66] CALL __VERIFIER_assert(z == zz) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.4s, OverallIterations: 31, TraceHistogramMax: 16, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6036 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6036 mSDsluCounter, 19971 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16297 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12702 IncrementalHoareTripleChecker+Invalid, 12840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 3674 mSDtfsCounter, 12702 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4719 GetRequests, 4369 SyntacticMatches, 0 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2654 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3096occurred in iteration=30, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 30 MinimizatonAttempts, 1476 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 7816 NumberOfCodeBlocks, 7520 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 9456 ConstructedInterpolants, 0 QuantifiedInterpolants, 23220 SizeOfPredicates, 17 NumberOfNonLiveVariables, 6434 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 61 InterpolantComputations, 23 PerfectInterpolantSequences, 30931/41435 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 09:43:26,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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/bitvector/interleave_bits.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:43:27,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:43:28,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 09:43:28,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:43:28,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:43:28,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:43:28,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:43:28,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:43:28,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:43:28,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:43:28,023 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:43:28,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:43:28,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:43:28,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:43:28,023 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:43:28,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 09:43:28,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:43:28,025 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:28,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:43:28,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:43:28,026 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 09:43:28,026 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 09:43:28,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:43:28,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:43:28,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:43:28,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:43:28,026 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 -> 41cbcdfa6f09b615c08bb2dbf908be5e0a68dc8c6a10c0ba76a3c4e4c07e69fb [2025-03-03 09:43:28,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:43:28,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:43:28,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:43:28,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:43:28,268 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:43:28,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-03 09:43:29,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51dc510f6/7680fdc8f92346f5b98133da4c73da95/FLAG0a6b87e3b [2025-03-03 09:43:29,590 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:43:29,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/interleave_bits.i [2025-03-03 09:43:29,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51dc510f6/7680fdc8f92346f5b98133da4c73da95/FLAG0a6b87e3b [2025-03-03 09:43:29,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51dc510f6/7680fdc8f92346f5b98133da4c73da95 [2025-03-03 09:43:29,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:43:29,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:43:29,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:29,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:43:29,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:43:29,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:29" (1/1) ... [2025-03-03 09:43:29,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c5d0c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:29, skipping insertion in model container [2025-03-03 09:43:29,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:29" (1/1) ... [2025-03-03 09:43:29,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:43:30,079 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/bitvector/interleave_bits.i[1175,1188] [2025-03-03 09:43:30,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:30,100 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:43:30,106 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/bitvector/interleave_bits.i[1175,1188] [2025-03-03 09:43:30,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:30,122 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:43:30,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30 WrapperNode [2025-03-03 09:43:30,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:30,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:30,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:43:30,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:43:30,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,146 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-03-03 09:43:30,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:30,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:43:30,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:43:30,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:43:30,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,159 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-03 09:43:30,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:43:30,170 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:43:30,170 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:43:30,170 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:43:30,171 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (1/1) ... [2025-03-03 09:43:30,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:30,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:30,195 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 09:43:30,198 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 09:43:30,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:43:30,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 09:43:30,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:43:30,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:43:30,262 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:43:30,263 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:43:30,357 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 09:43:30,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:43:30,363 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:43:30,363 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:43:30,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:30 BoogieIcfgContainer [2025-03-03 09:43:30,364 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:43:30,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:43:30,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:43:30,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:43:30,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:29" (1/3) ... [2025-03-03 09:43:30,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de9f7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:30, skipping insertion in model container [2025-03-03 09:43:30,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:30" (2/3) ... [2025-03-03 09:43:30,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de9f7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:30, skipping insertion in model container [2025-03-03 09:43:30,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:30" (3/3) ... [2025-03-03 09:43:30,370 INFO L128 eAbstractionObserver]: Analyzing ICFG interleave_bits.i [2025-03-03 09:43:30,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:43:30,382 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG interleave_bits.i that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:43:30,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:43:30,418 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;@48b381e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:43:30,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:43:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-03 09:43:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 09:43:30,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:30,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 09:43:30,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:30,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:30,428 INFO L85 PathProgramCache]: Analyzing trace with hash 38139366, now seen corresponding path program 1 times [2025-03-03 09:43:30,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:30,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299063868] [2025-03-03 09:43:30,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:30,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:30,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:30,437 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 09:43:30,438 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 09:43:30,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 09:43:30,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 09:43:30,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:30,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:30,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:43:30,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:30,509 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 09:43:30,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:30,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:43:30,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299063868] [2025-03-03 09:43:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299063868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251206770] [2025-03-03 09:43:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:30,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:43:30,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:30,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:30,525 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 09:43:30,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:30,540 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-03-03 09:43:30,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:30,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-03 09:43:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:30,545 INFO L225 Difference]: With dead ends: 18 [2025-03-03 09:43:30,546 INFO L226 Difference]: Without dead ends: 7 [2025-03-03 09:43:30,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03 09:43:30,549 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:30,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2025-03-03 09:43:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2025-03-03 09:43:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 09:43:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2025-03-03 09:43:30,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2025-03-03 09:43:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:30,575 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2025-03-03 09:43:30,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 09:43:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2025-03-03 09:43:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-03 09:43:30,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:30,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-03 09:43:30,581 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-03 09:43:30,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:30,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:30,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1182352094, now seen corresponding path program 1 times [2025-03-03 09:43:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:30,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730614490] [2025-03-03 09:43:30,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:30,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:30,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:30,780 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 09:43:30,781 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 09:43:30,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-03 09:43:30,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-03 09:43:30,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:30,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:30,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:43:30,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:30,832 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 09:43:30,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:30,862 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 09:43:30,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:43:30,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730614490] [2025-03-03 09:43:30,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730614490] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:30,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:30,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-03-03 09:43:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60804377] [2025-03-03 09:43:30,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:30,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:43:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:43:30,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:43:30,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:43:30,863 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-03 09:43:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:30,898 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-03-03 09:43:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:43:30,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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) Word has length 6 [2025-03-03 09:43:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:30,899 INFO L225 Difference]: With dead ends: 13 [2025-03-03 09:43:30,899 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 09:43:30,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:43:30,900 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:30,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 09:43:30,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-03 09:43:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 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 09:43:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2025-03-03 09:43:30,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2025-03-03 09:43:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:30,904 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2025-03-03 09:43:30,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 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-03 09:43:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2025-03-03 09:43:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:43:30,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:30,905 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2025-03-03 09:43:30,912 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 09:43:31,105 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 [2025-03-03 09:43:31,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:31,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 455963622, now seen corresponding path program 2 times [2025-03-03 09:43:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:31,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885820344] [2025-03-03 09:43:31,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:43:31,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:31,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:31,108 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-03 09:43:31,109 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-03 09:43:31,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-03 09:43:31,147 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:43:31,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:43:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:31,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:43:31,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:31,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:31,288 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:43:31,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885820344] [2025-03-03 09:43:31,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885820344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:31,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:31,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 09:43:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599611045] [2025-03-03 09:43:31,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:31,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:43:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:43:31,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:43:31,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:43:31,290 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 09:43:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:31,422 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2025-03-03 09:43:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:43:31,423 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 9 [2025-03-03 09:43:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:31,423 INFO L225 Difference]: With dead ends: 19 [2025-03-03 09:43:31,423 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 09:43:31,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:43:31,424 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:31,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 09:43:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-03 09:43:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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 09:43:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2025-03-03 09:43:31,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2025-03-03 09:43:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:31,428 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2025-03-03 09:43:31,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 09:43:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2025-03-03 09:43:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 09:43:31,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:31,428 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2025-03-03 09:43:31,435 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-03 09:43:31,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:31,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:31,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash -427781914, now seen corresponding path program 3 times [2025-03-03 09:43:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:31,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256481338] [2025-03-03 09:43:31,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:43:31,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:31,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:31,637 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-03 09:43:31,638 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-03 09:43:31,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-03-03 09:43:31,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 09:43:31,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:43:31,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:31,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:43:31,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:31,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:32,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:43:32,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256481338] [2025-03-03 09:43:32,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256481338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:32,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:32,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-03-03 09:43:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955120384] [2025-03-03 09:43:32,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:32,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:43:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:43:32,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:43:32,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:43:32,080 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 09:43:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:32,569 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-03-03 09:43:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:43:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 15 [2025-03-03 09:43:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:32,570 INFO L225 Difference]: With dead ends: 31 [2025-03-03 09:43:32,570 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:43:32,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=771, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 09:43:32,571 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:32,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:43:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 09:43:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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 09:43:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2025-03-03 09:43:32,576 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2025-03-03 09:43:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:32,576 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2025-03-03 09:43:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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 09:43:32,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2025-03-03 09:43:32,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:43:32,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:32,577 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2025-03-03 09:43:32,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:43:32,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:32,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:32,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:32,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1136005658, now seen corresponding path program 4 times [2025-03-03 09:43:32,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 09:43:32,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414508468] [2025-03-03 09:43:32,778 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:43:32,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:32,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:32,781 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-03 09:43:32,782 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-03 09:43:32,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-03 09:43:32,851 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:43:32,851 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:43:32,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:32,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-03 09:43:32,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:33,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:45,237 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 09:43:45,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414508468] [2025-03-03 09:43:45,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414508468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:45,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:43:45,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2025-03-03 09:43:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752991283] [2025-03-03 09:43:45,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:45,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-03 09:43:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 09:43:45,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-03 09:43:45,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 09:43:45,238 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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 09:43:45,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:45,837 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2025-03-03 09:43:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:43:45,838 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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 21 [2025-03-03 09:43:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:45,838 INFO L225 Difference]: With dead ends: 29 [2025-03-03 09:43:45,838 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:43:45,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 09:43:45,839 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:45,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:43:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:43:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:43:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 09:43:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:43:45,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2025-03-03 09:43:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:45,840 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:43:45,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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 09:43:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:43:45,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:43:45,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:43:45,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:43:46,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:46,045 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-03-03 09:43:46,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:43:46,261 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:43:46,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:43:46 BoogieIcfgContainer [2025-03-03 09:43:46,286 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:43:46,287 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:43:46,287 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:43:46,287 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:43:46,287 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:30" (3/4) ... [2025-03-03 09:43:46,289 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:43:46,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-03 09:43:46,294 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:43:46,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:43:46,295 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:43:46,356 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:43:46,357 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:43:46,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:43:46,357 INFO L158 Benchmark]: Toolchain (without parser) took 16382.34ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 25.7MB in the end (delta: 33.6MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-03-03 09:43:46,358 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:46,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.91ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 47.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:43:46,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.60ms. Allocated memory is still 83.9MB. Free memory was 47.8MB in the beginning and 46.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:46,359 INFO L158 Benchmark]: Boogie Preprocessor took 22.56ms. Allocated memory is still 83.9MB. Free memory was 46.4MB in the beginning and 45.4MB in the end (delta: 978.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:43:46,359 INFO L158 Benchmark]: IcfgBuilder took 193.82ms. Allocated memory is still 83.9MB. Free memory was 45.1MB in the beginning and 34.9MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:43:46,359 INFO L158 Benchmark]: TraceAbstraction took 15920.84ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 32.7MB in the end (delta: 1.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2025-03-03 09:43:46,359 INFO L158 Benchmark]: Witness Printer took 69.90ms. Allocated memory is still 83.9MB. Free memory was 32.7MB in the beginning and 25.7MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:43:46,361 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.95ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.91ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 47.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.60ms. Allocated memory is still 83.9MB. Free memory was 47.8MB in the beginning and 46.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.56ms. Allocated memory is still 83.9MB. Free memory was 46.4MB in the beginning and 45.4MB in the end (delta: 978.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 193.82ms. Allocated memory is still 83.9MB. Free memory was 45.1MB in the beginning and 34.9MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15920.84ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 32.7MB in the end (delta: 1.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Witness Printer took 69.90ms. Allocated memory is still 83.9MB. Free memory was 32.7MB in the beginning and 25.7MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 25]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.6s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 505 IncrementalHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 25 mSDtfsCounter, 505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 98 ConstructedInterpolants, 1 QuantifiedInterpolants, 9653 SizeOfPredicates, 2 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 0/404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Location Invariant Derived location invariant: ((((((((((((((((((i == 9) && (z == (((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))))) || ((z == ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) && (i == 7))) || ((((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) == z) && (i == 2))) || ((i == 1) && (z == (0 | (((y & 1) << 1) | ((x & 1) << 0)))))) || ((i == 8) && (z == ((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))))) || ((i == 10) && (z == ((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9)))))) || ((z == ((((y & 32768) << 16) | ((x & 32768) << 15)) | ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))))) && (i == 16))) || ((i == 6) && (z == ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4))))))) || ((z == (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) && (i == 11))) || ((z == (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))) && (i == 5))) || ((z == ((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11))))) && (i == 12))) || ((z == ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13)))) && (i == 14))) || (((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) == z) && (i == 13))) || ((z == ((((y & 16384) << 15) | ((x & 16384) << 14)) | ((((((x & 2048) << 11) | ((y & 2048) << 12)) | (((((((x & 128) << 7) | ((y & 128) << 8)) | ((((x & 64) << 6) | ((y & 64) << 7)) | ((((x & 32) << 5) | ((y & 32) << 6)) | (((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))) | (((y & 16) << 5) | ((x & 16) << 4)))))) | (((y & 256) << 9) | ((x & 256) << 8))) | (((y & 512) << 10) | ((x & 512) << 9))) | (((x & 1024) << 10) | ((y & 1024) << 11)))) | (((x & 4096) << 12) | ((y & 4096) << 13))) | (((y & 8192) << 14) | ((x & 8192) << 13))))) && (i == 15))) || ((i == 0) && (z == 0))) || ((z == ((((y & 8) << 4) | ((x & 8) << 3)) | (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2))))) && (i == 4))) || ((i == 3) && (z == (((((y & 2) << 2) | ((x & 2) << 1)) | (0 | (((y & 1) << 1) | ((x & 1) << 0)))) | (((y & 4) << 3) | ((x & 4) << 2)))))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:43:46,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE