./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/bitvector/parity.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/bitvector/parity.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eee564c2f2dd097d9333bcedbb3a38ab621e663242043d1a65c28e5db37eda40 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:50:30,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:50:30,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:50:30,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:50:30,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:50:30,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:50:30,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:50:30,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:50:30,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:50:30,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:50:30,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:50:30,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:50:30,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:50:30,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:50:30,159 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:50:30,159 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:50:30,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:50:30,160 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:50:30,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:50:30,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:30,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:30,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:30,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:30,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:50:30,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:30,161 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:30,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:30,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:30,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:50:30,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:50:30,162 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:50:30,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:50:30,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:50:30,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:50:30,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:50:30,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:50:30,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:50:30,163 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 -> eee564c2f2dd097d9333bcedbb3a38ab621e663242043d1a65c28e5db37eda40 [2025-04-29 10:50:30,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:50:30,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:50:30,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:50:30,428 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:50:30,429 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:50:30,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/parity.c [2025-04-29 10:50:31,723 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91367cc5f/e8cb5a7067094905af385fb31c69c29a/FLAGf7f9b685a [2025-04-29 10:50:31,893 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:50:31,893 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/parity.c [2025-04-29 10:50:31,894 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:50:31,894 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:50:31,897 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91367cc5f/e8cb5a7067094905af385fb31c69c29a/FLAGf7f9b685a [2025-04-29 10:50:32,775 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91367cc5f/e8cb5a7067094905af385fb31c69c29a [2025-04-29 10:50:32,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:50:32,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:50:32,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:32,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:50:32,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:50:32,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c276a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32, skipping insertion in model container [2025-04-29 10:50:32,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:50:32,945 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/parity.c[499,512] [2025-04-29 10:50:32,965 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:32,970 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:50:32,993 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/parity.c[499,512] [2025-04-29 10:50:33,001 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:33,014 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:50:33,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33 WrapperNode [2025-04-29 10:50:33,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:33,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:33,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:50:33,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:50:33,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,036 INFO L138 Inliner]: procedures = 7, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2025-04-29 10:50:33,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:33,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:50:33,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:50:33,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:50:33,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,049 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:50:33,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:50:33,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:50:33,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:50:33,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:50:33,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (1/1) ... [2025-04-29 10:50:33,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:33,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:33,085 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-04-29 10:50:33,091 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-04-29 10:50:33,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:50:33,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:50:33,141 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:50:33,143 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:50:33,332 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-04-29 10:50:33,333 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:50:33,342 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:50:33,343 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:50:33,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:33 BoogieIcfgContainer [2025-04-29 10:50:33,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:50:33,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:50:33,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:50:33,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:50:33,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:50:32" (1/3) ... [2025-04-29 10:50:33,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7040782f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:33, skipping insertion in model container [2025-04-29 10:50:33,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:33" (2/3) ... [2025-04-29 10:50:33,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7040782f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:33, skipping insertion in model container [2025-04-29 10:50:33,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:33" (3/3) ... [2025-04-29 10:50:33,352 INFO L128 eAbstractionObserver]: Analyzing ICFG parity.c [2025-04-29 10:50:33,366 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:50:33,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parity.c that has 1 procedures, 31 locations, 44 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-29 10:50:33,414 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:50:33,425 INFO L340 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;@4b9bdebf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:50:33,426 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:50:33,429 INFO L278 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 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-04-29 10:50:33,433 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 10:50:33,433 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:33,434 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1238931972, now seen corresponding path program 1 times [2025-04-29 10:50:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660802138] [2025-04-29 10:50:33,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 10:50:33,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 10:50:33,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:33,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:33,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660802138] [2025-04-29 10:50:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660802138] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:33,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:33,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218153702] [2025-04-29 10:50:33,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:33,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:33,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:33,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:33,799 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 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 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:33,886 INFO L93 Difference]: Finished difference Result 62 states and 89 transitions. [2025-04-29 10:50:33,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:33,887 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 10:50:33,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:33,893 INFO L225 Difference]: With dead ends: 62 [2025-04-29 10:50:33,893 INFO L226 Difference]: Without dead ends: 29 [2025-04-29 10:50:33,896 INFO L436 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-04-29 10:50:33,899 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:33,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-29 10:50:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-29 10:50:33,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 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-04-29 10:50:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2025-04-29 10:50:33,936 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 13 [2025-04-29 10:50:33,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:33,936 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-04-29 10:50:33,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:33,937 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2025-04-29 10:50:33,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 10:50:33,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:33,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:50:33,938 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1238872390, now seen corresponding path program 1 times [2025-04-29 10:50:33,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612340548] [2025-04-29 10:50:33,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 10:50:33,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 10:50:33,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:34,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612340548] [2025-04-29 10:50:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612340548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368883686] [2025-04-29 10:50:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:34,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:34,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:34,101 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,149 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2025-04-29 10:50:34,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:34,150 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-29 10:50:34,150 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,151 INFO L225 Difference]: With dead ends: 82 [2025-04-29 10:50:34,151 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 10:50:34,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:34,154 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 152 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 10:50:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2025-04-29 10:50:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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-04-29 10:50:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2025-04-29 10:50:34,163 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 13 [2025-04-29 10:50:34,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,163 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2025-04-29 10:50:34,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:34,163 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2025-04-29 10:50:34,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 10:50:34,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:34,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:50:34,164 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1379367031, now seen corresponding path program 1 times [2025-04-29 10:50:34,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681265486] [2025-04-29 10:50:34,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:50:34,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:50:34,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:34,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681265486] [2025-04-29 10:50:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681265486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917323019] [2025-04-29 10:50:34,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:34,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:34,268 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-04-29 10:50:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,319 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2025-04-29 10:50:34,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:34,319 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2025-04-29 10:50:34,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,320 INFO L225 Difference]: With dead ends: 66 [2025-04-29 10:50:34,320 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 10:50:34,320 INFO L436 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-04-29 10:50:34,320 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,321 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 10:50:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-29 10:50:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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-04-29 10:50:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2025-04-29 10:50:34,325 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 14 [2025-04-29 10:50:34,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,326 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-04-29 10:50:34,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-04-29 10:50:34,326 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2025-04-29 10:50:34,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 10:50:34,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:34,327 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:50:34,327 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1672866808, now seen corresponding path program 1 times [2025-04-29 10:50:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496668840] [2025-04-29 10:50:34,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:50:34,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:50:34,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:34,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496668840] [2025-04-29 10:50:34,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496668840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:34,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574368483] [2025-04-29 10:50:34,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:34,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:34,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:34,456 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-04-29 10:50:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,512 INFO L93 Difference]: Finished difference Result 82 states and 107 transitions. [2025-04-29 10:50:34,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:34,513 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 15 [2025-04-29 10:50:34,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,513 INFO L225 Difference]: With dead ends: 82 [2025-04-29 10:50:34,513 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 10:50:34,514 INFO L436 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-04-29 10:50:34,514 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 10:50:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-29 10:50:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 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-04-29 10:50:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-04-29 10:50:34,518 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 15 [2025-04-29 10:50:34,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,518 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-04-29 10:50:34,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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-04-29 10:50:34,518 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-04-29 10:50:34,519 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 10:50:34,519 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:34,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:50:34,519 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1681181827, now seen corresponding path program 1 times [2025-04-29 10:50:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133276188] [2025-04-29 10:50:34,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 10:50:34,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 10:50:34,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133276188] [2025-04-29 10:50:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133276188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415179700] [2025-04-29 10:50:34,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:34,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:34,596 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-04-29 10:50:34,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,652 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2025-04-29 10:50:34,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:34,652 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) Word has length 16 [2025-04-29 10:50:34,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,653 INFO L225 Difference]: With dead ends: 78 [2025-04-29 10:50:34,653 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 10:50:34,653 INFO L436 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-04-29 10:50:34,653 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 10:50:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-04-29 10:50:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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-04-29 10:50:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-04-29 10:50:34,659 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 16 [2025-04-29 10:50:34,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,659 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-04-29 10:50:34,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-04-29 10:50:34,659 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-04-29 10:50:34,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 10:50:34,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:34,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:50:34,660 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1505536327, now seen corresponding path program 1 times [2025-04-29 10:50:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871981073] [2025-04-29 10:50:34,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 10:50:34,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 10:50:34,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871981073] [2025-04-29 10:50:34,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871981073] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:34,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599655039] [2025-04-29 10:50:34,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:34,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:34,767 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-04-29 10:50:34,769 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-04-29 10:50:34,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 10:50:34,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 10:50:34,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 10:50:34,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:34,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:34,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599655039] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:34,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:34,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2025-04-29 10:50:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000855965] [2025-04-29 10:50:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:34,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:50:34,953 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-04-29 10:50:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:35,032 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2025-04-29 10:50:35,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:50:35,032 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-04-29 10:50:35,032 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:35,033 INFO L225 Difference]: With dead ends: 81 [2025-04-29 10:50:35,033 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 10:50:35,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:50:35,035 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:35,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 10:50:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-04-29 10:50:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-04-29 10:50:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2025-04-29 10:50:35,042 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 17 [2025-04-29 10:50:35,043 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:35,043 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-04-29 10:50:35,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-04-29 10:50:35,043 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2025-04-29 10:50:35,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 10:50:35,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:35,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:35,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:50:35,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-29 10:50:35,244 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1042563454, now seen corresponding path program 1 times [2025-04-29 10:50:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931038371] [2025-04-29 10:50:35,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:50:35,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:50:35,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:35,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931038371] [2025-04-29 10:50:35,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931038371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:35,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468933694] [2025-04-29 10:50:35,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:35,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:35,335 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-04-29 10:50:35,337 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-04-29 10:50:35,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:50:35,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:50:35,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 10:50:35,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:35,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:35,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468933694] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:35,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:35,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 12 [2025-04-29 10:50:35,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132941646] [2025-04-29 10:50:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:35,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:50:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:35,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:50:35,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-29 10:50:35,526 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-04-29 10:50:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:35,616 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2025-04-29 10:50:35,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:50:35,617 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 10:50:35,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:35,618 INFO L225 Difference]: With dead ends: 83 [2025-04-29 10:50:35,618 INFO L226 Difference]: Without dead ends: 75 [2025-04-29 10:50:35,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-29 10:50:35,618 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:35,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 84 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-29 10:50:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2025-04-29 10:50:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-04-29 10:50:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2025-04-29 10:50:35,626 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 18 [2025-04-29 10:50:35,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:35,627 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2025-04-29 10:50:35,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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-04-29 10:50:35,627 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2025-04-29 10:50:35,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 10:50:35,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:35,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:35,634 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-04-29 10:50:35,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-29 10:50:35,828 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,828 INFO L85 PathProgramCache]: Analyzing trace with hash 708335164, now seen corresponding path program 1 times [2025-04-29 10:50:35,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520029201] [2025-04-29 10:50:35,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 10:50:35,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 10:50:35,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520029201] [2025-04-29 10:50:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520029201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:35,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875463613] [2025-04-29 10:50:35,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:35,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:35,900 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-04-29 10:50:35,901 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-04-29 10:50:35,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 10:50:35,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 10:50:35,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 10:50:35,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:36,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:36,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875463613] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:36,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:36,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7] total 11 [2025-04-29 10:50:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20165334] [2025-04-29 10:50:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:36,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:36,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:36,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:36,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:36,109 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-04-29 10:50:36,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:36,187 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2025-04-29 10:50:36,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:50:36,187 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2025-04-29 10:50:36,187 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:36,188 INFO L225 Difference]: With dead ends: 81 [2025-04-29 10:50:36,188 INFO L226 Difference]: Without dead ends: 71 [2025-04-29 10:50:36,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:36,188 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:36,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-04-29 10:50:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 55. [2025-04-29 10:50:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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-04-29 10:50:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-04-29 10:50:36,194 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 19 [2025-04-29 10:50:36,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:36,195 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-04-29 10:50:36,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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-04-29 10:50:36,196 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-04-29 10:50:36,196 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 10:50:36,196 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:36,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:36,202 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-04-29 10:50:36,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:36,397 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:36,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:36,397 INFO L85 PathProgramCache]: Analyzing trace with hash -265174931, now seen corresponding path program 1 times [2025-04-29 10:50:36,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:36,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282928251] [2025-04-29 10:50:36,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:36,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 10:50:36,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 10:50:36,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:36,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:36,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282928251] [2025-04-29 10:50:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282928251] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:36,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776833258] [2025-04-29 10:50:36,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:36,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:36,559 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-04-29 10:50:36,562 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-04-29 10:50:36,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 10:50:36,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 10:50:36,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:36,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 10:50:36,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:36,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776833258] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:36,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:36,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 14 [2025-04-29 10:50:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060549561] [2025-04-29 10:50:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:36,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:50:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:36,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:50:36,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:50:36,790 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-04-29 10:50:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:36,881 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2025-04-29 10:50:36,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:50:36,882 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2025-04-29 10:50:36,882 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:36,882 INFO L225 Difference]: With dead ends: 83 [2025-04-29 10:50:36,882 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 10:50:36,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:50:36,883 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:36,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 10:50:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2025-04-29 10:50:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 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-04-29 10:50:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-04-29 10:50:36,889 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 19 [2025-04-29 10:50:36,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:36,889 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-04-29 10:50:36,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-04-29 10:50:36,889 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-04-29 10:50:36,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 10:50:36,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:36,890 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] [2025-04-29 10:50:36,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 10:50:37,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:37,090 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:37,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1998540336, now seen corresponding path program 1 times [2025-04-29 10:50:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:37,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376078640] [2025-04-29 10:50:37,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:37,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:50:37,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:50:37,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:37,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376078640] [2025-04-29 10:50:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376078640] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:37,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493419650] [2025-04-29 10:50:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:37,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:37,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:37,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:37,153 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:37,170 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2025-04-29 10:50:37,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:37,170 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 10:50:37,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:37,171 INFO L225 Difference]: With dead ends: 114 [2025-04-29 10:50:37,171 INFO L226 Difference]: Without dead ends: 58 [2025-04-29 10:50:37,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:37,172 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:37,172 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-29 10:50:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2025-04-29 10:50:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 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-04-29 10:50:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-04-29 10:50:37,175 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 20 [2025-04-29 10:50:37,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:37,175 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-04-29 10:50:37,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:37,176 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-04-29 10:50:37,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 10:50:37,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:37,176 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] [2025-04-29 10:50:37,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 10:50:37,177 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:37,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1998480754, now seen corresponding path program 1 times [2025-04-29 10:50:37,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:37,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318147594] [2025-04-29 10:50:37,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:37,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:50:37,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:50:37,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:37,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:37,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318147594] [2025-04-29 10:50:37,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318147594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:37,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947354400] [2025-04-29 10:50:37,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:37,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:37,305 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-04-29 10:50:37,307 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-04-29 10:50:37,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:50:37,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:50:37,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 10:50:37,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:37,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947354400] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:37,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 18 [2025-04-29 10:50:37,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304672121] [2025-04-29 10:50:37,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:37,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:50:37,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:37,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:50:37,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-29 10:50:37,561 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:37,662 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2025-04-29 10:50:37,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:50:37,663 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 10:50:37,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:37,663 INFO L225 Difference]: With dead ends: 97 [2025-04-29 10:50:37,663 INFO L226 Difference]: Without dead ends: 89 [2025-04-29 10:50:37,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-29 10:50:37,664 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:37,664 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 102 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-29 10:50:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2025-04-29 10:50:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.206896551724138) internal successors, (70), 58 states have internal predecessors, (70), 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-04-29 10:50:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-04-29 10:50:37,668 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 20 [2025-04-29 10:50:37,668 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:37,668 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-04-29 10:50:37,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:37,668 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-04-29 10:50:37,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 10:50:37,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:37,669 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] [2025-04-29 10:50:37,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:37,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 10:50:37,872 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:37,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1349845915, now seen corresponding path program 1 times [2025-04-29 10:50:37,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:37,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923225404] [2025-04-29 10:50:37,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:37,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:50:37,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:50:37,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:38,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:38,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923225404] [2025-04-29 10:50:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923225404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:38,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974763949] [2025-04-29 10:50:38,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:38,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:38,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:38,053 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-04-29 10:50:38,055 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-04-29 10:50:38,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:50:38,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:50:38,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:38,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 10:50:38,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:38,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974763949] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:38,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 6] total 11 [2025-04-29 10:50:38,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434792580] [2025-04-29 10:50:38,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:38,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:50:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:38,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:50:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:38,238 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:38,302 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2025-04-29 10:50:38,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:38,302 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-29 10:50:38,303 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:38,303 INFO L225 Difference]: With dead ends: 115 [2025-04-29 10:50:38,303 INFO L226 Difference]: Without dead ends: 77 [2025-04-29 10:50:38,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:38,304 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:38,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 85 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:38,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-29 10:50:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-04-29 10:50:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 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-04-29 10:50:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2025-04-29 10:50:38,313 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 20 [2025-04-29 10:50:38,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:38,313 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2025-04-29 10:50:38,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:38,313 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2025-04-29 10:50:38,314 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 10:50:38,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:38,314 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] [2025-04-29 10:50:38,319 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-04-29 10:50:38,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:38,514 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:38,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash -756749590, now seen corresponding path program 1 times [2025-04-29 10:50:38,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:38,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388357184] [2025-04-29 10:50:38,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:38,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:38,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 10:50:38,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 10:50:38,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 10:50:38,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 10:50:38,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 10:50:38,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 10:50:38,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 10:50:38,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 10:50:38,536 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 10:50:38,536 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-29 10:50:38,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 10:50:38,540 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:38,564 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:50:38,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:50:38 BoogieIcfgContainer [2025-04-29 10:50:38,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:50:38,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:50:38,570 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:50:38,570 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:50:38,571 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:33" (3/4) ... [2025-04-29 10:50:38,572 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 10:50:38,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:50:38,573 INFO L158 Benchmark]: Toolchain (without parser) took 5795.93ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 112.9MB in the beginning and 366.5MB in the end (delta: -253.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2025-04-29 10:50:38,574 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:50:38,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.28ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 98.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:50:38,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.27ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:50:38,574 INFO L158 Benchmark]: Boogie Preprocessor took 21.76ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.5MB in the end (delta: 967.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:50:38,575 INFO L158 Benchmark]: RCFGBuilder took 284.23ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 83.2MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:50:38,575 INFO L158 Benchmark]: TraceAbstraction took 5224.58ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 82.2MB in the beginning and 366.6MB in the end (delta: -284.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:50:38,575 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 419.4MB. Free memory was 366.6MB in the beginning and 366.5MB in the end (delta: 87.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:50:38,578 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.27ms. Allocated memory is still 226.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.28ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 98.9MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.27ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 97.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.76ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 96.5MB in the end (delta: 967.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 284.23ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 83.2MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5224.58ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 82.2MB in the beginning and 366.6MB in the end (delta: -284.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 419.4MB. Free memory was 366.6MB in the beginning and 366.5MB in the end (delta: 87.0kB). 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: 16]: 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 bitwiseAnd at line 48. Possible FailurePath: [L25] unsigned int v = __VERIFIER_nondet_uint(); [L26] unsigned int v1; [L27] unsigned int v2; [L28] char parity1; [L29] char parity2; [L32] v1 = v [L33] parity1 = (char)0 VAL [parity1=0, v1=-4294967295, v=-4294967295] [L34] COND TRUE v1 != 0 VAL [parity1=0, v1=-4294967295, v=-4294967295] [L35] COND TRUE parity1 == (char)0 [L36] parity1 = (char)1 VAL [parity1=1, v1=-4294967295, v=-4294967295] [L40] EXPR v1 & (v1 - 1U) VAL [parity1=1, v=-4294967295] [L40] v1 = v1 & (v1 - 1U) [L34] COND FALSE !(v1 != 0) [L44] v2 = v [L45] parity2 = (char)0 VAL [parity1=1, v2=-4294967295] [L46] EXPR v2 ^ (v2 >> 1u) VAL [parity1=1] [L46] v2 = v2 ^ (v2 >> 1u) [L47] EXPR v2 ^ (v2 >> 2u) VAL [parity1=1] [L47] v2 = v2 ^ (v2 >> 2u) [L48] EXPR v2 & 286331153U VAL [parity1=1] [L48] v2 = (v2 & 286331153U) * 286331153U [L49] COND TRUE ((v2 >> 28u) & 1u) == 0 [L50] parity2 = (char)0 VAL [parity1=1, parity2=0] [L55] CALL __VERIFIER_assert(parity1 == parity2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 44 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 1100 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 737 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 794 IncrementalHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 363 mSDtfsCounter, 794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 189 SyntacticMatches, 23 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=12, 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 78 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 1785 SizeOfPredicates, 1 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 7/19 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-04-29 10:50:38,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/bitvector/parity.c -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 eee564c2f2dd097d9333bcedbb3a38ab621e663242043d1a65c28e5db37eda40 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:50:40,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:50:40,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-04-29 10:50:40,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:50:40,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:50:40,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:50:40,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:50:40,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:50:40,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:50:40,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:50:40,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:50:40,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:50:40,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:50:40,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:50:40,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:50:40,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:40,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:40,578 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:40,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 10:50:40,578 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 10:50:40,579 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:50:40,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:50:40,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:50:40,579 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 -> eee564c2f2dd097d9333bcedbb3a38ab621e663242043d1a65c28e5db37eda40 [2025-04-29 10:50:40,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:50:40,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:50:40,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:50:40,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:50:40,820 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:50:40,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/parity.c [2025-04-29 10:50:42,177 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e25be31/c8a51787cc0e4c8abee7035e7cbfabb7/FLAG2bd9ef0d4 [2025-04-29 10:50:42,322 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:50:42,322 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/parity.c [2025-04-29 10:50:42,323 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:50:42,323 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:50:42,327 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e25be31/c8a51787cc0e4c8abee7035e7cbfabb7/FLAG2bd9ef0d4 [2025-04-29 10:50:43,178 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5e25be31/c8a51787cc0e4c8abee7035e7cbfabb7 [2025-04-29 10:50:43,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:50:43,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:50:43,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:43,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:50:43,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:50:43,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503e1028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43, skipping insertion in model container [2025-04-29 10:50:43,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:50:43,381 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/parity.c[499,512] [2025-04-29 10:50:43,400 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:43,408 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:50:43,426 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/parity.c[499,512] [2025-04-29 10:50:43,432 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:43,444 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:50:43,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43 WrapperNode [2025-04-29 10:50:43,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:43,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:43,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:50:43,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:50:43,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,471 INFO L138 Inliner]: procedures = 7, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2025-04-29 10:50:43,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:43,472 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:50:43,472 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:50:43,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:50:43,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,489 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:50:43,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,494 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:50:43,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:50:43,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:50:43,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:50:43,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (1/1) ... [2025-04-29 10:50:43,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:43,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:43,533 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-04-29 10:50:43,536 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-04-29 10:50:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:50:43,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:50:43,603 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:50:43,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:50:43,718 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-04-29 10:50:43,719 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:50:43,728 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:50:43,728 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:50:43,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:43 BoogieIcfgContainer [2025-04-29 10:50:43,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:50:43,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:50:43,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:50:43,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:50:43,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:50:43" (1/3) ... [2025-04-29 10:50:43,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1222dd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:43, skipping insertion in model container [2025-04-29 10:50:43,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:43" (2/3) ... [2025-04-29 10:50:43,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1222dd58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:43, skipping insertion in model container [2025-04-29 10:50:43,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:43" (3/3) ... [2025-04-29 10:50:43,738 INFO L128 eAbstractionObserver]: Analyzing ICFG parity.c [2025-04-29 10:50:43,747 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:50:43,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parity.c that has 1 procedures, 14 locations, 17 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-29 10:50:43,789 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:50:43,798 INFO L340 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;@31214c48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:50:43,798 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:50:43,801 INFO L278 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-04-29 10:50:43,804 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 10:50:43,804 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:43,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:43,805 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:43,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1814479634, now seen corresponding path program 1 times [2025-04-29 10:50:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:43,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807307644] [2025-04-29 10:50:43,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:43,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:43,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:43,818 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-04-29 10:50:43,820 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-04-29 10:50:43,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 10:50:43,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 10:50:43,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:43,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:43,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:50:43,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:43,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:43,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:50:43,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807307644] [2025-04-29 10:50:43,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807307644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:43,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976980709] [2025-04-29 10:50:43,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:43,998 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:43,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:50:44,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:44,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:44,011 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-04-29 10:50:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:44,052 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-04-29 10:50:44,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:44,053 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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) Word has length 7 [2025-04-29 10:50:44,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:44,058 INFO L225 Difference]: With dead ends: 33 [2025-04-29 10:50:44,058 INFO L226 Difference]: Without dead ends: 15 [2025-04-29 10:50:44,060 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:44,064 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:44,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 45 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-04-29 10:50:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-04-29 10:50:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 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-04-29 10:50:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-04-29 10:50:44,088 INFO L79 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 7 [2025-04-29 10:50:44,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:44,088 INFO L485 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-04-29 10:50:44,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-04-29 10:50:44,089 INFO L278 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2025-04-29 10:50:44,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 10:50:44,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:44,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:44,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:50:44,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:44,291 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:44,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1814539216, now seen corresponding path program 1 times [2025-04-29 10:50:44,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:44,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156683848] [2025-04-29 10:50:44,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:44,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:44,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:44,295 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-04-29 10:50:44,297 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-04-29 10:50:44,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 10:50:44,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 10:50:44,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:44,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:44,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 10:50:44,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:44,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:44,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:50:44,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156683848] [2025-04-29 10:50:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156683848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:44,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:44,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:44,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919438546] [2025-04-29 10:50:44,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:44,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:44,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:50:44,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:44,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:44,390 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-04-29 10:50:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:44,418 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-04-29 10:50:44,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:44,418 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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) Word has length 7 [2025-04-29 10:50:44,418 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:44,419 INFO L225 Difference]: With dead ends: 22 [2025-04-29 10:50:44,419 INFO L226 Difference]: Without dead ends: 17 [2025-04-29 10:50:44,419 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-04-29 10:50:44,419 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:44,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-29 10:50:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-04-29 10:50:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-04-29 10:50:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-04-29 10:50:44,423 INFO L79 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2025-04-29 10:50:44,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:44,423 INFO L485 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-04-29 10:50:44,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-04-29 10:50:44,423 INFO L278 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-04-29 10:50:44,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 10:50:44,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:44,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:44,429 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-04-29 10:50:44,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:44,628 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:44,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash 534222926, now seen corresponding path program 1 times [2025-04-29 10:50:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:44,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781717938] [2025-04-29 10:50:44,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:44,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:44,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:44,631 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-04-29 10:50:44,633 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-04-29 10:50:44,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 10:50:44,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 10:50:44,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:44,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:44,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:50:44,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:44,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:45,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:50:45,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781717938] [2025-04-29 10:50:45,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781717938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:45,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-04-29 10:50:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913735400] [2025-04-29 10:50:45,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:45,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 10:50:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:50:45,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 10:50:45,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:50:45,184 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-04-29 10:50:45,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:45,351 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-04-29 10:50:45,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:50:45,352 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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) Word has length 10 [2025-04-29 10:50:45,352 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:45,353 INFO L225 Difference]: With dead ends: 36 [2025-04-29 10:50:45,353 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 10:50:45,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:50:45,354 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:45,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:50:45,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 10:50:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2025-04-29 10:50:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-04-29 10:50:45,365 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2025-04-29 10:50:45,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:45,365 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-04-29 10:50:45,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 10 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-04-29 10:50:45,365 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2025-04-29 10:50:45,365 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 10:50:45,365 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:45,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:45,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:50:45,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:45,566 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:45,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:45,566 INFO L85 PathProgramCache]: Analyzing trace with hash 534282508, now seen corresponding path program 1 times [2025-04-29 10:50:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:45,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210159979] [2025-04-29 10:50:45,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:45,570 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-04-29 10:50:45,570 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-04-29 10:50:45,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 10:50:45,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 10:50:45,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:45,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:45,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:50:45,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:45,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:45,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:50:45,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210159979] [2025-04-29 10:50:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210159979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:45,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:45,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893189688] [2025-04-29 10:50:45,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:45,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:50:45,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:45,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:45,622 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-04-29 10:50:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:45,639 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-04-29 10:50:45,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:45,640 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-29 10:50:45,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:45,640 INFO L225 Difference]: With dead ends: 45 [2025-04-29 10:50:45,640 INFO L226 Difference]: Without dead ends: 25 [2025-04-29 10:50:45,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:45,641 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 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-04-29 10:50:45,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-04-29 10:50:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-04-29 10:50:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2025-04-29 10:50:45,646 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 10 [2025-04-29 10:50:45,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:45,646 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2025-04-29 10:50:45,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-04-29 10:50:45,647 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2025-04-29 10:50:45,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 10:50:45,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:45,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:45,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 10:50:45,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:45,847 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:45,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:45,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1491290322, now seen corresponding path program 1 times [2025-04-29 10:50:45,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:45,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677550934] [2025-04-29 10:50:45,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:45,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:45,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:45,850 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-04-29 10:50:45,852 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-04-29 10:50:45,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 10:50:45,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 10:50:45,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:45,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:45,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 10:50:45,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:46,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:46,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:50:46,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677550934] [2025-04-29 10:50:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677550934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:46,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2025-04-29 10:50:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917170949] [2025-04-29 10:50:46,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:46,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 10:50:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:50:46,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 10:50:46,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:50:46,576 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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-04-29 10:50:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:46,730 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-04-29 10:50:46,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 10:50:46,730 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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 13 [2025-04-29 10:50:46,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:46,731 INFO L225 Difference]: With dead ends: 33 [2025-04-29 10:50:46,731 INFO L226 Difference]: Without dead ends: 27 [2025-04-29 10:50:46,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:50:46,733 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:46,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-04-29 10:50:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-04-29 10:50:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-04-29 10:50:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2025-04-29 10:50:46,736 INFO L79 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 13 [2025-04-29 10:50:46,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:46,736 INFO L485 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2025-04-29 10:50:46,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 states have internal predecessors, (22), 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-04-29 10:50:46,739 INFO L278 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2025-04-29 10:50:46,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 10:50:46,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:46,739 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:46,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 10:50:46,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:46,940 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:46,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash 624142666, now seen corresponding path program 1 times [2025-04-29 10:50:46,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:46,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [379371346] [2025-04-29 10:50:46,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:46,942 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-04-29 10:50:46,943 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-04-29 10:50:46,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:50:47,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:50:47,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:47,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:47,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 10:50:47,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:47,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:50,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:50:50,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379371346] [2025-04-29 10:50:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379371346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:50,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:50:50,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2025-04-29 10:50:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757596446] [2025-04-29 10:50:50,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:50,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 10:50:50,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:50:50,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 10:50:50,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-04-29 10:50:50,540 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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-04-29 10:50:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:55,486 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2025-04-29 10:50:55,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:50:55,487 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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 22 [2025-04-29 10:50:55,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:55,488 INFO L225 Difference]: With dead ends: 54 [2025-04-29 10:50:55,488 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 10:50:55,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2025-04-29 10:50:55,489 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:55,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-29 10:50:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 10:50:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-29 10:50:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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-04-29 10:50:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-04-29 10:50:55,500 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2025-04-29 10:50:55,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:55,500 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-04-29 10:50:55,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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-04-29 10:50:55,500 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-04-29 10:50:55,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:50:55,500 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:55,500 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:55,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 10:50:55,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:55,701 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:55,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 230671958, now seen corresponding path program 2 times [2025-04-29 10:50:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:55,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535438989] [2025-04-29 10:50:55,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:55,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:55,703 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-04-29 10:50:55,704 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-04-29 10:50:55,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-29 10:50:55,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:50:55,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:55,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:55,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 10:50:55,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:56,497 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:56,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:01,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:01,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535438989] [2025-04-29 10:51:01,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535438989] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:01,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:51:01,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2025-04-29 10:51:01,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986375126] [2025-04-29 10:51:01,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:01,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 10:51:01,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:01,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 10:51:01,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-04-29 10:51:01,670 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 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-04-29 10:51:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:07,741 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2025-04-29 10:51:07,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-29 10:51:07,742 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 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 25 [2025-04-29 10:51:07,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:07,742 INFO L225 Difference]: With dead ends: 57 [2025-04-29 10:51:07,742 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 10:51:07,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2025-04-29 10:51:07,743 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:07,744 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 146 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 10:51:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 10:51:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-04-29 10:51:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 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-04-29 10:51:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2025-04-29 10:51:07,750 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 25 [2025-04-29 10:51:07,750 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:07,750 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2025-04-29 10:51:07,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 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-04-29 10:51:07,751 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2025-04-29 10:51:07,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 10:51:07,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:07,751 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:07,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 10:51:07,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:07,952 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:07,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:07,952 INFO L85 PathProgramCache]: Analyzing trace with hash -810943166, now seen corresponding path program 2 times [2025-04-29 10:51:07,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:07,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694963060] [2025-04-29 10:51:07,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:51:07,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:07,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:07,954 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-04-29 10:51:07,955 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-04-29 10:51:07,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-29 10:51:08,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 10:51:08,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:51:08,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:08,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 10:51:08,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:18,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... Killed by 15