./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.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/byte_add_1-1.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 d3c1793e950c8f85b0960b5207fd961cb553be1ed3c66b52bd385c52719c7f68 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:50:29,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:50:29,745 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:29,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:50:29,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:50:29,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:50:29,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:50:29,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:50:29,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:50:29,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:50:29,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:50:29,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:50:29,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:50:29,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:50:29,771 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:50:29,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:50:29,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:50:29,772 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:50:29,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:29,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:29,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:29,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:29,773 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:50:29,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:29,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:29,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:29,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:29,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:50:29,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:50:29,774 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:50:29,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:50:29,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:50:29,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:50:29,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:50:29,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:50:29,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:50:29,774 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 -> d3c1793e950c8f85b0960b5207fd961cb553be1ed3c66b52bd385c52719c7f68 [2025-04-29 10:50:30,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:50:30,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:50:30,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:50:30,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:50:30,025 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:50:30,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.c [2025-04-29 10:50:31,300 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e56f20f/74a15c6722144db98943067bd281785f/FLAG2453754f5 [2025-04-29 10:50:31,505 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:50:31,507 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.c [2025-04-29 10:50:31,508 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,508 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,515 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e56f20f/74a15c6722144db98943067bd281785f/FLAG2453754f5 [2025-04-29 10:50:32,351 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e56f20f/74a15c6722144db98943067bd281785f [2025-04-29 10:50:32,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:50:32,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:50:32,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:32,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:50:32,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:50:32,358 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,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cd5c26 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,360 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,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:50:32,482 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/byte_add_1-1.c[499,512] [2025-04-29 10:50:32,526 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:32,530 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:50:32,546 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/byte_add_1-1.c[499,512] [2025-04-29 10:50:32,567 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:32,576 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:50:32,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32 WrapperNode [2025-04-29 10:50:32,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:32,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:32,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:50:32,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:50:32,582 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:32" (1/1) ... [2025-04-29 10:50:32,589 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:32" (1/1) ... [2025-04-29 10:50:32,615 INFO L138 Inliner]: procedures = 8, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2025-04-29 10:50:32,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:32,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:50:32,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:50:32,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:50:32,622 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:32" (1/1) ... [2025-04-29 10:50:32,622 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:32" (1/1) ... [2025-04-29 10:50:32,625 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:32" (1/1) ... [2025-04-29 10:50:32,635 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:50:32,635 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:32" (1/1) ... [2025-04-29 10:50:32,635 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:32" (1/1) ... [2025-04-29 10:50:32,638 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:32" (1/1) ... [2025-04-29 10:50:32,639 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:32" (1/1) ... [2025-04-29 10:50:32,642 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:32" (1/1) ... [2025-04-29 10:50:32,643 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:32" (1/1) ... [2025-04-29 10:50:32,644 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:32" (1/1) ... [2025-04-29 10:50:32,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:50:32,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:50:32,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:50:32,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:50:32,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (1/1) ... [2025-04-29 10:50:32,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:32,682 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:32,686 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:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:50:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:50:32,746 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:50:32,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:50:33,004 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-04-29 10:50:33,004 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:50:33,012 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:50:33,012 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:50:33,013 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,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:50:33,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:50:33,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:50:33,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:50:33,019 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,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee7a100 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,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:32" (2/3) ... [2025-04-29 10:50:33,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee7a100 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,020 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,021 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.c [2025-04-29 10:50:33,031 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:50:33,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_1-1.c that has 1 procedures, 51 locations, 84 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-29 10:50:33,081 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:50:33,091 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;@47b771db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:50:33,091 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:50:33,094 INFO L278 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 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,098 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 10:50:33,098 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,098 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:33,099 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1570190741, now seen corresponding path program 1 times [2025-04-29 10:50:33,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526902140] [2025-04-29 10:50:33,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:50:33,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:50:33,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:33,344 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,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:33,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526902140] [2025-04-29 10:50:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526902140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:33,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:33,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:50:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641725897] [2025-04-29 10:50:33,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:33,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:33,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:33,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:33,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:33,369 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 50 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:33,513 INFO L93 Difference]: Finished difference Result 115 states and 196 transitions. [2025-04-29 10:50:33,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:33,514 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:33,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:33,519 INFO L225 Difference]: With dead ends: 115 [2025-04-29 10:50:33,519 INFO L226 Difference]: Without dead ends: 70 [2025-04-29 10:50:33,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:33,523 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:33,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-29 10:50:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-04-29 10:50:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 0 states have call successors, (0), 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,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-04-29 10:50:33,546 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2025-04-29 10:50:33,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:33,546 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-04-29 10:50:33,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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:33,546 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-04-29 10:50:33,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 10:50:33,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,547 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:33,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:50:33,547 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2007922496, now seen corresponding path program 1 times [2025-04-29 10:50:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406548623] [2025-04-29 10:50:33,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 10:50:33,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 10:50:33,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:33,708 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:33,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:33,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406548623] [2025-04-29 10:50:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406548623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:33,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:33,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:33,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952948454] [2025-04-29 10:50:33,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:33,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:33,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:33,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:33,711 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:33,881 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2025-04-29 10:50:33,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:33,881 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-29 10:50:33,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:33,883 INFO L225 Difference]: With dead ends: 164 [2025-04-29 10:50:33,883 INFO L226 Difference]: Without dead ends: 127 [2025-04-29 10:50:33,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:33,884 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:33,884 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-29 10:50:33,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2025-04-29 10:50:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 states have internal predecessors, (139), 0 states have call successors, (0), 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,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2025-04-29 10:50:33,893 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2025-04-29 10:50:33,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:33,893 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2025-04-29 10:50:33,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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,893 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2025-04-29 10:50:33,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 10:50:33,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,894 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:33,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:50:33,894 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash -50508049, now seen corresponding path program 1 times [2025-04-29 10:50:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428834783] [2025-04-29 10:50:33,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:50:33,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:50:33,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:34,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428834783] [2025-04-29 10:50:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428834783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:34,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481462410] [2025-04-29 10:50:34,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:34,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:34,032 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,185 INFO L93 Difference]: Finished difference Result 234 states and 354 transitions. [2025-04-29 10:50:34,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:34,186 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 27 [2025-04-29 10:50:34,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,186 INFO L225 Difference]: With dead ends: 234 [2025-04-29 10:50:34,187 INFO L226 Difference]: Without dead ends: 156 [2025-04-29 10:50:34,188 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,189 INFO L437 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,190 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 215 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:34,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-04-29 10:50:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2025-04-29 10:50:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 states have internal predecessors, (148), 0 states have call successors, (0), 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,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2025-04-29 10:50:34,201 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 27 [2025-04-29 10:50:34,201 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,201 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2025-04-29 10:50:34,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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,202 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2025-04-29 10:50:34,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:50:34,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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:34,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:50:34,203 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash -446870146, now seen corresponding path program 1 times [2025-04-29 10:50:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991897584] [2025-04-29 10:50:34,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:50:34,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:50:34,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 10:50:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991897584] [2025-04-29 10:50:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991897584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:34,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714200918] [2025-04-29 10:50:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:34,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:34,347 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,513 INFO L93 Difference]: Finished difference Result 255 states and 380 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 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 28 [2025-04-29 10:50:34,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,514 INFO L225 Difference]: With dead ends: 255 [2025-04-29 10:50:34,515 INFO L226 Difference]: Without dead ends: 176 [2025-04-29 10:50:34,515 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,516 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 74 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 223 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-29 10:50:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2025-04-29 10:50:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 0 states have call successors, (0), 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,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2025-04-29 10:50:34,531 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2025-04-29 10:50:34,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,531 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2025-04-29 10:50:34,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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,532 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2025-04-29 10:50:34,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 10:50:34,532 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:34,532 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:50:34,532 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1153653824, now seen corresponding path program 1 times [2025-04-29 10:50:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47291671] [2025-04-29 10:50:34,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:50:34,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:50:34,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:34,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47291671] [2025-04-29 10:50:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47291671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:34,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523791642] [2025-04-29 10:50:34,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:34,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:34,632 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,633 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,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:50:34,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 10:50:34,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 10:50:34,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:34,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:34,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523791642] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-04-29 10:50:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656907814] [2025-04-29 10:50:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:34,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:34,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:34,729 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,740 INFO L93 Difference]: Finished difference Result 191 states and 283 transitions. [2025-04-29 10:50:34,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:34,740 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 29 [2025-04-29 10:50:34,740 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,741 INFO L225 Difference]: With dead ends: 191 [2025-04-29 10:50:34,741 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 10:50:34,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:34,742 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 69 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 10:50:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 10:50:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 94 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 138 transitions. [2025-04-29 10:50:34,751 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 138 transitions. Word has length 29 [2025-04-29 10:50:34,751 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,751 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 138 transitions. [2025-04-29 10:50:34,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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,751 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 138 transitions. [2025-04-29 10:50:34,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:50:34,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:34,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:34,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:34,952 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash 45152607, now seen corresponding path program 1 times [2025-04-29 10:50:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448375738] [2025-04-29 10:50:34,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:50:34,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:50:34,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:50:35,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448375738] [2025-04-29 10:50:35,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448375738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:35,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:35,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:50:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138337515] [2025-04-29 10:50:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:35,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:35,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:35,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:35,034 INFO L87 Difference]: Start difference. First operand 95 states and 138 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:35,047 INFO L93 Difference]: Finished difference Result 140 states and 203 transitions. [2025-04-29 10:50:35,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:35,047 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-04-29 10:50:35,047 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:35,048 INFO L225 Difference]: With dead ends: 140 [2025-04-29 10:50:35,048 INFO L226 Difference]: Without dead ends: 111 [2025-04-29 10:50:35,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:35,048 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:35,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-29 10:50:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-04-29 10:50:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 0 states have call successors, (0), 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,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-04-29 10:50:35,057 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 35 [2025-04-29 10:50:35,057 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:35,057 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-04-29 10:50:35,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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,057 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-04-29 10:50:35,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:50:35,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:35,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:35,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:50:35,060 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 467854433, now seen corresponding path program 1 times [2025-04-29 10:50:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840533352] [2025-04-29 10:50:35,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:50:35,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 10:50:35,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:50:35,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840533352] [2025-04-29 10:50:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840533352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:35,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:35,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490269564] [2025-04-29 10:50:35,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:35,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:35,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:35,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:35,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:35,135 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:35,292 INFO L93 Difference]: Finished difference Result 310 states and 476 transitions. [2025-04-29 10:50:35,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:35,293 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-04-29 10:50:35,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:35,293 INFO L225 Difference]: With dead ends: 310 [2025-04-29 10:50:35,294 INFO L226 Difference]: Without dead ends: 218 [2025-04-29 10:50:35,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:35,294 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 95 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:35,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 97 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-04-29 10:50:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 152. [2025-04-29 10:50:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.509933774834437) internal successors, (228), 151 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 228 transitions. [2025-04-29 10:50:35,305 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 228 transitions. Word has length 35 [2025-04-29 10:50:35,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:35,307 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 228 transitions. [2025-04-29 10:50:35,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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,308 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 228 transitions. [2025-04-29 10:50:35,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 10:50:35,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:35,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:35,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:50:35,309 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1756595340, now seen corresponding path program 1 times [2025-04-29 10:50:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505485797] [2025-04-29 10:50:35,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 10:50:35,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 10:50:35,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:35,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505485797] [2025-04-29 10:50:35,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505485797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:35,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776211842] [2025-04-29 10:50:35,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:35,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:35,477 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,479 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,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 10:50:35,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 10:50:35,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 10:50:35,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:35,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776211842] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:35,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2025-04-29 10:50:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83158036] [2025-04-29 10:50:35,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:35,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 10:50:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:35,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 10:50:35,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-04-29 10:50:35,819 INFO L87 Difference]: Start difference. First operand 152 states and 228 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 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,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:37,019 INFO L93 Difference]: Finished difference Result 936 states and 1401 transitions. [2025-04-29 10:50:37,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-29 10:50:37,019 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 10:50:37,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:37,021 INFO L225 Difference]: With dead ends: 936 [2025-04-29 10:50:37,021 INFO L226 Difference]: Without dead ends: 753 [2025-04-29 10:50:37,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=700, Invalid=2492, Unknown=0, NotChecked=0, Total=3192 [2025-04-29 10:50:37,023 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 1320 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:37,023 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 235 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:50:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-04-29 10:50:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 294. [2025-04-29 10:50:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 1.484641638225256) internal successors, (435), 293 states have internal predecessors, (435), 0 states have call successors, (0), 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,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 435 transitions. [2025-04-29 10:50:37,045 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 435 transitions. Word has length 41 [2025-04-29 10:50:37,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:37,045 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 435 transitions. [2025-04-29 10:50:37,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 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,045 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 435 transitions. [2025-04-29 10:50:37,046 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-29 10:50:37,047 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:37,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:37,054 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:37,248 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,SelfDestructingSolverStorable7 [2025-04-29 10:50:37,248 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:37,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -240583854, now seen corresponding path program 1 times [2025-04-29 10:50:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:37,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240225907] [2025-04-29 10:50:37,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:37,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 10:50:37,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 10:50:37,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-29 10:50:37,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:37,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240225907] [2025-04-29 10:50:37,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240225907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:37,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:37,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:37,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623563786] [2025-04-29 10:50:37,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:37,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:37,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:37,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:37,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:37,396 INFO L87 Difference]: Start difference. First operand 294 states and 435 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:37,423 INFO L93 Difference]: Finished difference Result 305 states and 449 transitions. [2025-04-29 10:50:37,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:37,424 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 56 [2025-04-29 10:50:37,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:37,425 INFO L225 Difference]: With dead ends: 305 [2025-04-29 10:50:37,426 INFO L226 Difference]: Without dead ends: 297 [2025-04-29 10:50:37,426 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:37,427 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:37,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 162 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-04-29 10:50:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2025-04-29 10:50:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.4829931972789117) internal successors, (436), 294 states have internal predecessors, (436), 0 states have call successors, (0), 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,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 436 transitions. [2025-04-29 10:50:37,437 INFO L79 Accepts]: Start accepts. Automaton has 295 states and 436 transitions. Word has length 56 [2025-04-29 10:50:37,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:37,438 INFO L485 AbstractCegarLoop]: Abstraction has 295 states and 436 transitions. [2025-04-29 10:50:37,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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,439 INFO L278 IsEmpty]: Start isEmpty. Operand 295 states and 436 transitions. [2025-04-29 10:50:37,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-04-29 10:50:37,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:37,440 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:37,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 10:50:37,440 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:37,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:37,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1597826398, now seen corresponding path program 1 times [2025-04-29 10:50:37,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:37,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644183805] [2025-04-29 10:50:37,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 10:50:37,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 10:50:37,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:37,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:37,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644183805] [2025-04-29 10:50:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644183805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:37,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911916265] [2025-04-29 10:50:37,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:37,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:37,577 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:37,579 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:37,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-29 10:50:37,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-29 10:50:37,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 10:50:37,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:37,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 10:50:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911916265] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:38,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:38,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-04-29 10:50:38,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487283891] [2025-04-29 10:50:38,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:38,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 10:50:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:38,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 10:50:38,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:50:38,139 INFO L87 Difference]: Start difference. First operand 295 states and 436 transitions. Second operand has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 0 states have call successors, (0), 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:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:40,645 INFO L93 Difference]: Finished difference Result 2437 states and 3769 transitions. [2025-04-29 10:50:40,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-29 10:50:40,645 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 0 states have call successors, (0), 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 57 [2025-04-29 10:50:40,646 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:40,652 INFO L225 Difference]: With dead ends: 2437 [2025-04-29 10:50:40,652 INFO L226 Difference]: Without dead ends: 2028 [2025-04-29 10:50:40,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1197, Invalid=6113, Unknown=0, NotChecked=0, Total=7310 [2025-04-29 10:50:40,657 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 686 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 2419 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 2550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:40,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 475 Invalid, 2550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2419 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-29 10:50:40,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2025-04-29 10:50:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 477. [2025-04-29 10:50:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4285714285714286) internal successors, (680), 476 states have internal predecessors, (680), 0 states have call successors, (0), 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:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 680 transitions. [2025-04-29 10:50:40,686 INFO L79 Accepts]: Start accepts. Automaton has 477 states and 680 transitions. Word has length 57 [2025-04-29 10:50:40,686 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:40,686 INFO L485 AbstractCegarLoop]: Abstraction has 477 states and 680 transitions. [2025-04-29 10:50:40,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.6875) internal successors, (123), 16 states have internal predecessors, (123), 0 states have call successors, (0), 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:40,686 INFO L278 IsEmpty]: Start isEmpty. Operand 477 states and 680 transitions. [2025-04-29 10:50:40,687 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 10:50:40,687 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:40,687 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:40,693 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:40,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:40,892 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:40,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2147300428, now seen corresponding path program 1 times [2025-04-29 10:50:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:40,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584918305] [2025-04-29 10:50:40,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:40,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:40,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 10:50:40,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 10:50:40,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:40,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 10:50:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:41,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584918305] [2025-04-29 10:50:41,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584918305] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:41,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365971069] [2025-04-29 10:50:41,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:41,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:41,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:41,093 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:41,095 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:41,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 10:50:41,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 10:50:41,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:41,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:41,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 10:50:41,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:41,222 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-04-29 10:50:41,222 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:41,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365971069] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:41,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:41,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-04-29 10:50:41,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021803971] [2025-04-29 10:50:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:41,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:41,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:41,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:41,223 INFO L87 Difference]: Start difference. First operand 477 states and 680 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:41,306 INFO L93 Difference]: Finished difference Result 1408 states and 2014 transitions. [2025-04-29 10:50:41,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:50:41,306 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 66 [2025-04-29 10:50:41,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:41,309 INFO L225 Difference]: With dead ends: 1408 [2025-04-29 10:50:41,309 INFO L226 Difference]: Without dead ends: 968 [2025-04-29 10:50:41,310 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:41,310 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 144 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:41,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 198 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-04-29 10:50:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 722. [2025-04-29 10:50:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 721 states have (on average 1.4230235783633842) internal successors, (1026), 721 states have internal predecessors, (1026), 0 states have call successors, (0), 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:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1026 transitions. [2025-04-29 10:50:41,339 INFO L79 Accepts]: Start accepts. Automaton has 722 states and 1026 transitions. Word has length 66 [2025-04-29 10:50:41,339 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:41,339 INFO L485 AbstractCegarLoop]: Abstraction has 722 states and 1026 transitions. [2025-04-29 10:50:41,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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:41,339 INFO L278 IsEmpty]: Start isEmpty. Operand 722 states and 1026 transitions. [2025-04-29 10:50:41,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-29 10:50:41,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:41,343 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:41,349 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:41,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:41,543 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:41,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1380271539, now seen corresponding path program 1 times [2025-04-29 10:50:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:41,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156307866] [2025-04-29 10:50:41,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:41,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 10:50:41,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 10:50:41,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-29 10:50:41,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:41,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156307866] [2025-04-29 10:50:41,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156307866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:41,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643310258] [2025-04-29 10:50:41,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:41,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:41,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:41,651 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:41,653 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:41,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 10:50:41,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 10:50:41,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:41,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:41,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 10:50:41,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-04-29 10:50:41,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:41,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643310258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:41,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-04-29 10:50:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102652605] [2025-04-29 10:50:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:41,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:41,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:41,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:50:41,777 INFO L87 Difference]: Start difference. First operand 722 states and 1026 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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:41,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:41,846 INFO L93 Difference]: Finished difference Result 1214 states and 1729 transitions. [2025-04-29 10:50:41,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:41,847 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 67 [2025-04-29 10:50:41,847 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:41,850 INFO L225 Difference]: With dead ends: 1214 [2025-04-29 10:50:41,850 INFO L226 Difference]: Without dead ends: 971 [2025-04-29 10:50:41,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:50:41,851 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 75 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:41,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 113 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-04-29 10:50:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 959. [2025-04-29 10:50:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 1.4227557411273486) internal successors, (1363), 958 states have internal predecessors, (1363), 0 states have call successors, (0), 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:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1363 transitions. [2025-04-29 10:50:41,875 INFO L79 Accepts]: Start accepts. Automaton has 959 states and 1363 transitions. Word has length 67 [2025-04-29 10:50:41,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:41,875 INFO L485 AbstractCegarLoop]: Abstraction has 959 states and 1363 transitions. [2025-04-29 10:50:41,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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:41,876 INFO L278 IsEmpty]: Start isEmpty. Operand 959 states and 1363 transitions. [2025-04-29 10:50:41,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-04-29 10:50:41,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:41,877 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:41,883 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:42,078 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,SelfDestructingSolverStorable11 [2025-04-29 10:50:42,078 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:42,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1551188204, now seen corresponding path program 1 times [2025-04-29 10:50:42,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:42,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446696357] [2025-04-29 10:50:42,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:42,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 10:50:42,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 10:50:42,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:42,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 10:50:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:42,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446696357] [2025-04-29 10:50:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446696357] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:42,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119496224] [2025-04-29 10:50:42,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:42,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:42,253 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:42,255 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:42,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-29 10:50:42,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-29 10:50:42,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:42,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:42,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 10:50:42,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-29 10:50:42,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:42,476 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 10:50:42,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119496224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:42,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:42,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 14 [2025-04-29 10:50:42,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933604495] [2025-04-29 10:50:42,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:42,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:50:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:42,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:50:42,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:50:42,478 INFO L87 Difference]: Start difference. First operand 959 states and 1363 transitions. Second operand has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 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:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:42,873 INFO L93 Difference]: Finished difference Result 2607 states and 3790 transitions. [2025-04-29 10:50:42,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 10:50:42,874 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 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) Word has length 67 [2025-04-29 10:50:42,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:42,878 INFO L225 Difference]: With dead ends: 2607 [2025-04-29 10:50:42,879 INFO L226 Difference]: Without dead ends: 1547 [2025-04-29 10:50:42,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-04-29 10:50:42,880 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 232 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:42,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 256 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-04-29 10:50:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 938. [2025-04-29 10:50:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 1.367129135538954) internal successors, (1281), 937 states have internal predecessors, (1281), 0 states have call successors, (0), 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:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1281 transitions. [2025-04-29 10:50:42,911 INFO L79 Accepts]: Start accepts. Automaton has 938 states and 1281 transitions. Word has length 67 [2025-04-29 10:50:42,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:42,911 INFO L485 AbstractCegarLoop]: Abstraction has 938 states and 1281 transitions. [2025-04-29 10:50:42,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 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:42,912 INFO L278 IsEmpty]: Start isEmpty. Operand 938 states and 1281 transitions. [2025-04-29 10:50:42,913 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 10:50:42,913 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:42,913 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:42,919 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:43,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:43,114 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:43,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash -932201342, now seen corresponding path program 1 times [2025-04-29 10:50:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:43,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641916337] [2025-04-29 10:50:43,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:43,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:43,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 10:50:43,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 10:50:43,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:43,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:50:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:43,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641916337] [2025-04-29 10:50:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641916337] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:43,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744196340] [2025-04-29 10:50:43,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:43,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:43,234 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:43,236 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:43,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 10:50:43,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 10:50:43,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:43,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:43,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 10:50:43,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:43,353 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:50:43,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 50 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:50:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744196340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:43,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:43,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-29 10:50:43,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973923326] [2025-04-29 10:50:43,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:43,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:50:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:43,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:50:43,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:50:43,407 INFO L87 Difference]: Start difference. First operand 938 states and 1281 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:43,542 INFO L93 Difference]: Finished difference Result 2226 states and 2949 transitions. [2025-04-29 10:50:43,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 10:50:43,542 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 71 [2025-04-29 10:50:43,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:43,546 INFO L225 Difference]: With dead ends: 2226 [2025-04-29 10:50:43,546 INFO L226 Difference]: Without dead ends: 1321 [2025-04-29 10:50:43,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:43,548 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 172 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:43,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 285 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-04-29 10:50:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 949. [2025-04-29 10:50:43,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 1.3164556962025316) internal successors, (1248), 948 states have internal predecessors, (1248), 0 states have call successors, (0), 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,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1248 transitions. [2025-04-29 10:50:43,585 INFO L79 Accepts]: Start accepts. Automaton has 949 states and 1248 transitions. Word has length 71 [2025-04-29 10:50:43,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:43,586 INFO L485 AbstractCegarLoop]: Abstraction has 949 states and 1248 transitions. [2025-04-29 10:50:43,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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,586 INFO L278 IsEmpty]: Start isEmpty. Operand 949 states and 1248 transitions. [2025-04-29 10:50:43,587 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 10:50:43,589 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:43,589 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:43,595 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:50:43,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:43,790 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:43,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1806962366, now seen corresponding path program 1 times [2025-04-29 10:50:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:43,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535917716] [2025-04-29 10:50:43,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:43,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 10:50:43,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 10:50:43,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:43,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 10:50:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:43,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535917716] [2025-04-29 10:50:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535917716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:43,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 10:50:43,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643534606] [2025-04-29 10:50:43,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:43,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:50:43,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:43,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:50:43,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:50:43,928 INFO L87 Difference]: Start difference. First operand 949 states and 1248 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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:50:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:44,246 INFO L93 Difference]: Finished difference Result 2119 states and 2788 transitions. [2025-04-29 10:50:44,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:50:44,246 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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 71 [2025-04-29 10:50:44,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:44,249 INFO L225 Difference]: With dead ends: 2119 [2025-04-29 10:50:44,249 INFO L226 Difference]: Without dead ends: 1193 [2025-04-29 10:50:44,251 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:44,251 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 263 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:44,251 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 350 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2025-04-29 10:50:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1173. [2025-04-29 10:50:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.3139931740614335) internal successors, (1540), 1172 states have internal predecessors, (1540), 0 states have call successors, (0), 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,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1540 transitions. [2025-04-29 10:50:44,286 INFO L79 Accepts]: Start accepts. Automaton has 1173 states and 1540 transitions. Word has length 71 [2025-04-29 10:50:44,286 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:44,286 INFO L485 AbstractCegarLoop]: Abstraction has 1173 states and 1540 transitions. [2025-04-29 10:50:44,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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:50:44,287 INFO L278 IsEmpty]: Start isEmpty. Operand 1173 states and 1540 transitions. [2025-04-29 10:50:44,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 10:50:44,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:44,288 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:44,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 10:50:44,288 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:44,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:44,288 INFO L85 PathProgramCache]: Analyzing trace with hash -120782528, now seen corresponding path program 1 times [2025-04-29 10:50:44,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:44,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058241829] [2025-04-29 10:50:44,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:44,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:44,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 10:50:44,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 10:50:44,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:44,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:44,425 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-29 10:50:44,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:44,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058241829] [2025-04-29 10:50:44,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058241829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 10:50:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323196523] [2025-04-29 10:50:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:44,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 10:50:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:44,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 10:50:44,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:50:44,426 INFO L87 Difference]: Start difference. First operand 1173 states and 1540 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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:50:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:44,734 INFO L93 Difference]: Finished difference Result 2082 states and 2721 transitions. [2025-04-29 10:50:44,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:50:44,735 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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 71 [2025-04-29 10:50:44,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:44,737 INFO L225 Difference]: With dead ends: 2082 [2025-04-29 10:50:44,737 INFO L226 Difference]: Without dead ends: 907 [2025-04-29 10:50:44,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:50:44,739 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 332 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:44,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 336 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-04-29 10:50:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 806. [2025-04-29 10:50:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.26583850931677) internal successors, (1019), 805 states have internal predecessors, (1019), 0 states have call successors, (0), 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,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1019 transitions. [2025-04-29 10:50:44,762 INFO L79 Accepts]: Start accepts. Automaton has 806 states and 1019 transitions. Word has length 71 [2025-04-29 10:50:44,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:44,762 INFO L485 AbstractCegarLoop]: Abstraction has 806 states and 1019 transitions. [2025-04-29 10:50:44,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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:50:44,762 INFO L278 IsEmpty]: Start isEmpty. Operand 806 states and 1019 transitions. [2025-04-29 10:50:44,763 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-04-29 10:50:44,763 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:44,763 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:44,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 10:50:44,763 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:44,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash -837675760, now seen corresponding path program 1 times [2025-04-29 10:50:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:44,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247463146] [2025-04-29 10:50:44,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:44,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:44,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 10:50:44,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:50:44,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:44,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:50:44,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:44,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247463146] [2025-04-29 10:50:44,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247463146] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:44,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941677682] [2025-04-29 10:50:44,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:44,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:44,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:44,978 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:50:44,979 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:50:45,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 10:50:45,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:50:45,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:45,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:45,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 10:50:45,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:50:45,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:50:45,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941677682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:45,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:45,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-29 10:50:45,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221267343] [2025-04-29 10:50:45,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:45,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:50:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:45,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:50:45,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:50:45,804 INFO L87 Difference]: Start difference. First operand 806 states and 1019 transitions. Second operand has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 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,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:46,083 INFO L93 Difference]: Finished difference Result 1295 states and 1598 transitions. [2025-04-29 10:50:46,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:50:46,084 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 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 73 [2025-04-29 10:50:46,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:46,086 INFO L225 Difference]: With dead ends: 1295 [2025-04-29 10:50:46,086 INFO L226 Difference]: Without dead ends: 921 [2025-04-29 10:50:46,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2025-04-29 10:50:46,088 INFO L437 NwaCegarLoop]: 134 mSDtfsCounter, 319 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:46,088 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 720 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-04-29 10:50:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 684. [2025-04-29 10:50:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.2606149341142021) internal successors, (861), 683 states have internal predecessors, (861), 0 states have call successors, (0), 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,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 861 transitions. [2025-04-29 10:50:46,110 INFO L79 Accepts]: Start accepts. Automaton has 684 states and 861 transitions. Word has length 73 [2025-04-29 10:50:46,110 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:46,110 INFO L485 AbstractCegarLoop]: Abstraction has 684 states and 861 transitions. [2025-04-29 10:50:46,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 0 states have call successors, (0), 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,110 INFO L278 IsEmpty]: Start isEmpty. Operand 684 states and 861 transitions. [2025-04-29 10:50:46,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-04-29 10:50:46,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:46,111 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:46,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:46,312 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 10:50:46,312 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:46,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash -923502128, now seen corresponding path program 2 times [2025-04-29 10:50:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:46,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496773661] [2025-04-29 10:50:46,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:46,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-04-29 10:50:46,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:50:46,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:46,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:46,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496773661] [2025-04-29 10:50:46,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496773661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:46,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722190313] [2025-04-29 10:50:46,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:46,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:46,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:46,561 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:46,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 10:50:46,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-04-29 10:50:46,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:50:46,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:46,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:46,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 10:50:46,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 10:50:46,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 10:50:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722190313] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:47,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:47,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2025-04-29 10:50:47,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350377559] [2025-04-29 10:50:47,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:47,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-29 10:50:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:47,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-29 10:50:47,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-04-29 10:50:47,463 INFO L87 Difference]: Start difference. First operand 684 states and 861 transitions. Second operand has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 states have internal predecessors, (165), 0 states have call successors, (0), 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:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:48,943 INFO L93 Difference]: Finished difference Result 2447 states and 3010 transitions. [2025-04-29 10:50:48,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-29 10:50:48,944 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 states have internal predecessors, (165), 0 states have call successors, (0), 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 73 [2025-04-29 10:50:48,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:48,949 INFO L225 Difference]: With dead ends: 2447 [2025-04-29 10:50:48,949 INFO L226 Difference]: Without dead ends: 2434 [2025-04-29 10:50:48,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=528, Invalid=2552, Unknown=0, NotChecked=0, Total=3080 [2025-04-29 10:50:48,950 INFO L437 NwaCegarLoop]: 210 mSDtfsCounter, 403 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:48,950 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 2035 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 10:50:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-04-29 10:50:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 1194. [2025-04-29 10:50:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1193 states have (on average 1.2757753562447611) internal successors, (1522), 1193 states have internal predecessors, (1522), 0 states have call successors, (0), 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:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1522 transitions. [2025-04-29 10:50:48,991 INFO L79 Accepts]: Start accepts. Automaton has 1194 states and 1522 transitions. Word has length 73 [2025-04-29 10:50:48,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:48,991 INFO L485 AbstractCegarLoop]: Abstraction has 1194 states and 1522 transitions. [2025-04-29 10:50:48,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.5) internal successors, (165), 22 states have internal predecessors, (165), 0 states have call successors, (0), 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:48,991 INFO L278 IsEmpty]: Start isEmpty. Operand 1194 states and 1522 transitions. [2025-04-29 10:50:48,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-04-29 10:50:48,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:48,992 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:49,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 10:50:49,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 10:50:49,197 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:49,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:49,197 INFO L85 PathProgramCache]: Analyzing trace with hash -47483122, now seen corresponding path program 1 times [2025-04-29 10:50:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:49,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043304676] [2025-04-29 10:50:49,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:49,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 10:50:49,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:50:49,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:49,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:49,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043304676] [2025-04-29 10:50:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043304676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:49,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710159786] [2025-04-29 10:50:49,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:49,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:49,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:49,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:49,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 10:50:49,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 10:50:49,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:50:49,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:49,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:49,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 10:50:49,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 10:50:49,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 10:50:49,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710159786] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:49,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:49,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-04-29 10:50:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535517811] [2025-04-29 10:50:49,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:49,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 10:50:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:49,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 10:50:49,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2025-04-29 10:50:49,826 INFO L87 Difference]: Start difference. First operand 1194 states and 1522 transitions. Second operand has 21 states, 21 states have (on average 8.666666666666666) internal successors, (182), 21 states have internal predecessors, (182), 0 states have call successors, (0), 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:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:50,431 INFO L93 Difference]: Finished difference Result 1671 states and 2089 transitions. [2025-04-29 10:50:50,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-29 10:50:50,431 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.666666666666666) internal successors, (182), 21 states have internal predecessors, (182), 0 states have call successors, (0), 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 73 [2025-04-29 10:50:50,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:50,435 INFO L225 Difference]: With dead ends: 1671 [2025-04-29 10:50:50,435 INFO L226 Difference]: Without dead ends: 1659 [2025-04-29 10:50:50,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=477, Invalid=1875, Unknown=0, NotChecked=0, Total=2352 [2025-04-29 10:50:50,436 INFO L437 NwaCegarLoop]: 147 mSDtfsCounter, 332 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:50,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1151 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-04-29 10:50:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1241. [2025-04-29 10:50:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1240 states have (on average 1.2733870967741936) internal successors, (1579), 1240 states have internal predecessors, (1579), 0 states have call successors, (0), 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:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1579 transitions. [2025-04-29 10:50:50,481 INFO L79 Accepts]: Start accepts. Automaton has 1241 states and 1579 transitions. Word has length 73 [2025-04-29 10:50:50,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:50,481 INFO L485 AbstractCegarLoop]: Abstraction has 1241 states and 1579 transitions. [2025-04-29 10:50:50,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.666666666666666) internal successors, (182), 21 states have internal predecessors, (182), 0 states have call successors, (0), 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:50,481 INFO L278 IsEmpty]: Start isEmpty. Operand 1241 states and 1579 transitions. [2025-04-29 10:50:50,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-29 10:50:50,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:50,483 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:50,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 10:50:50,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:50,687 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:50,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash 93328998, now seen corresponding path program 1 times [2025-04-29 10:50:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:50,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742827033] [2025-04-29 10:50:50,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:50,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-29 10:50:50,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-29 10:50:50,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:50,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:50,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:50,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742827033] [2025-04-29 10:50:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742827033] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:50,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563521260] [2025-04-29 10:50:50,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:50,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:50,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:50,845 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:50,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 10:50:50,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-29 10:50:50,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-29 10:50:50,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:50,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:50,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:50:50,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-04-29 10:50:50,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563521260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-04-29 10:50:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048120026] [2025-04-29 10:50:50,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:50,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:50,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:50,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:50:50,963 INFO L87 Difference]: Start difference. First operand 1241 states and 1579 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:51,010 INFO L93 Difference]: Finished difference Result 1254 states and 1594 transitions. [2025-04-29 10:50:51,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:51,011 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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) Word has length 74 [2025-04-29 10:50:51,011 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:51,013 INFO L225 Difference]: With dead ends: 1254 [2025-04-29 10:50:51,013 INFO L226 Difference]: Without dead ends: 1249 [2025-04-29 10:50:51,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:50:51,014 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:51,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 161 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-04-29 10:50:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1243. [2025-04-29 10:50:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.2737520128824478) internal successors, (1582), 1242 states have internal predecessors, (1582), 0 states have call successors, (0), 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:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1582 transitions. [2025-04-29 10:50:51,062 INFO L79 Accepts]: Start accepts. Automaton has 1243 states and 1582 transitions. Word has length 74 [2025-04-29 10:50:51,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:51,062 INFO L485 AbstractCegarLoop]: Abstraction has 1243 states and 1582 transitions. [2025-04-29 10:50:51,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:51,063 INFO L278 IsEmpty]: Start isEmpty. Operand 1243 states and 1582 transitions. [2025-04-29 10:50:51,064 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-29 10:50:51,064 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:51,064 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:51,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 10:50:51,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:51,269 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:51,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1389864726, now seen corresponding path program 1 times [2025-04-29 10:50:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:51,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368753084] [2025-04-29 10:50:51,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:51,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 10:50:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:50:51,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:51,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:51,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368753084] [2025-04-29 10:50:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368753084] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:51,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112334870] [2025-04-29 10:50:51,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:51,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:51,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:51,416 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:51,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 10:50:51,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 10:50:51,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:50:51,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:51,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:51,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 10:50:51,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:51,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112334870] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:51,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:51,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-29 10:50:51,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23008099] [2025-04-29 10:50:51,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:51,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 10:50:51,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:51,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 10:50:51,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:50:51,969 INFO L87 Difference]: Start difference. First operand 1243 states and 1582 transitions. Second operand has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 0 states have call successors, (0), 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:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:52,885 INFO L93 Difference]: Finished difference Result 3071 states and 3797 transitions. [2025-04-29 10:50:52,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-29 10:50:52,885 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-04-29 10:50:52,886 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:52,891 INFO L225 Difference]: With dead ends: 3071 [2025-04-29 10:50:52,891 INFO L226 Difference]: Without dead ends: 3066 [2025-04-29 10:50:52,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 141 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=642, Invalid=2114, Unknown=0, NotChecked=0, Total=2756 [2025-04-29 10:50:52,893 INFO L437 NwaCegarLoop]: 114 mSDtfsCounter, 728 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:52,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1153 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:50:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2025-04-29 10:50:52,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 1547. [2025-04-29 10:50:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 1.3272962483829236) internal successors, (2052), 1546 states have internal predecessors, (2052), 0 states have call successors, (0), 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:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2052 transitions. [2025-04-29 10:50:52,951 INFO L79 Accepts]: Start accepts. Automaton has 1547 states and 2052 transitions. Word has length 75 [2025-04-29 10:50:52,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:52,951 INFO L485 AbstractCegarLoop]: Abstraction has 1547 states and 2052 transitions. [2025-04-29 10:50:52,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.25) internal successors, (164), 16 states have internal predecessors, (164), 0 states have call successors, (0), 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:52,952 INFO L278 IsEmpty]: Start isEmpty. Operand 1547 states and 2052 transitions. [2025-04-29 10:50:52,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-29 10:50:52,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:52,953 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:52,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:53,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 10:50:53,154 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:53,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash 249424875, now seen corresponding path program 1 times [2025-04-29 10:50:53,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:53,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719585918] [2025-04-29 10:50:53,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:53,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:53,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 10:50:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:50:53,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:53,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:53,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719585918] [2025-04-29 10:50:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719585918] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:53,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104261387] [2025-04-29 10:50:53,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:53,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:53,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:53,409 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:53,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 10:50:53,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 10:50:53,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:50:53,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:53,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:53,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 10:50:53,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-04-29 10:50:53,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:53,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104261387] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:53,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:53,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-04-29 10:50:53,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505513498] [2025-04-29 10:50:53,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:53,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:53,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:53,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:53,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:50:53,939 INFO L87 Difference]: Start difference. First operand 1547 states and 2052 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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:54,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:54,034 INFO L93 Difference]: Finished difference Result 1563 states and 2070 transitions. [2025-04-29 10:50:54,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:50:54,034 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-04-29 10:50:54,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:54,038 INFO L225 Difference]: With dead ends: 1563 [2025-04-29 10:50:54,038 INFO L226 Difference]: Without dead ends: 1558 [2025-04-29 10:50:54,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:50:54,040 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:54,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2025-04-29 10:50:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1458. [2025-04-29 10:50:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1457 states have (on average 1.3294440631434454) internal successors, (1937), 1457 states have internal predecessors, (1937), 0 states have call successors, (0), 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:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1937 transitions. [2025-04-29 10:50:54,093 INFO L79 Accepts]: Start accepts. Automaton has 1458 states and 1937 transitions. Word has length 75 [2025-04-29 10:50:54,094 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:54,094 INFO L485 AbstractCegarLoop]: Abstraction has 1458 states and 1937 transitions. [2025-04-29 10:50:54,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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:54,094 INFO L278 IsEmpty]: Start isEmpty. Operand 1458 states and 1937 transitions. [2025-04-29 10:50:54,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-04-29 10:50:54,095 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:54,095 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:54,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:54,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-29 10:50:54,296 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:54,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash -80784601, now seen corresponding path program 1 times [2025-04-29 10:50:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:54,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522292207] [2025-04-29 10:50:54,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:54,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-29 10:50:54,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 10:50:54,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:54,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:54,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522292207] [2025-04-29 10:50:54,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522292207] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:54,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539806514] [2025-04-29 10:50:54,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:54,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:54,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:54,467 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:54,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 10:50:54,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-29 10:50:54,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-29 10:50:54,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:54,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:54,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 10:50:54,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:54,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539806514] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:54,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-29 10:50:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317697123] [2025-04-29 10:50:54,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:54,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 10:50:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:54,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 10:50:54,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-04-29 10:50:54,873 INFO L87 Difference]: Start difference. First operand 1458 states and 1937 transitions. Second operand has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 0 states have call successors, (0), 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,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:55,386 INFO L93 Difference]: Finished difference Result 2448 states and 3170 transitions. [2025-04-29 10:50:55,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-29 10:50:55,387 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 0 states have call successors, (0), 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 76 [2025-04-29 10:50:55,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:55,392 INFO L225 Difference]: With dead ends: 2448 [2025-04-29 10:50:55,392 INFO L226 Difference]: Without dead ends: 2436 [2025-04-29 10:50:55,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=404, Invalid=1156, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 10:50:55,393 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 370 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:55,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1140 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:50:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-04-29 10:50:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1620. [2025-04-29 10:50:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 1.343421865348981) internal successors, (2175), 1619 states have internal predecessors, (2175), 0 states have call successors, (0), 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,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 2175 transitions. [2025-04-29 10:50:55,455 INFO L79 Accepts]: Start accepts. Automaton has 1620 states and 2175 transitions. Word has length 76 [2025-04-29 10:50:55,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:55,457 INFO L485 AbstractCegarLoop]: Abstraction has 1620 states and 2175 transitions. [2025-04-29 10:50:55,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.294117647058824) internal successors, (209), 17 states have internal predecessors, (209), 0 states have call successors, (0), 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,457 INFO L278 IsEmpty]: Start isEmpty. Operand 1620 states and 2175 transitions. [2025-04-29 10:50:55,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-29 10:50:55,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:55,459 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:55,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:55,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:55,659 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:55,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash 377016416, now seen corresponding path program 1 times [2025-04-29 10:50:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:55,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247107118] [2025-04-29 10:50:55,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:55,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 10:50:55,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 10:50:55,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:55,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:55,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247107118] [2025-04-29 10:50:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247107118] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:55,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799197666] [2025-04-29 10:50:55,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:55,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:55,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:55,918 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:55,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 10:50:55,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 10:50:56,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 10:50:56,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:56,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:56,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 10:50:56,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-29 10:50:56,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799197666] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:56,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:56,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-04-29 10:50:56,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793297948] [2025-04-29 10:50:56,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:56,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 10:50:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:56,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 10:50:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-04-29 10:50:56,615 INFO L87 Difference]: Start difference. First operand 1620 states and 2175 transitions. Second operand has 21 states, 21 states have (on average 8.19047619047619) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 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:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:58,278 INFO L93 Difference]: Finished difference Result 3221 states and 4079 transitions. [2025-04-29 10:50:58,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-29 10:50:58,278 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.19047619047619) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-04-29 10:50:58,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:58,284 INFO L225 Difference]: With dead ends: 3221 [2025-04-29 10:50:58,284 INFO L226 Difference]: Without dead ends: 3216 [2025-04-29 10:50:58,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=684, Invalid=3222, Unknown=0, NotChecked=0, Total=3906 [2025-04-29 10:50:58,285 INFO L437 NwaCegarLoop]: 249 mSDtfsCounter, 338 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:58,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 2379 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1361 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 10:50:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2025-04-29 10:50:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 1716. [2025-04-29 10:50:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1715 states have (on average 1.3451895043731779) internal successors, (2307), 1715 states have internal predecessors, (2307), 0 states have call successors, (0), 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:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2307 transitions. [2025-04-29 10:50:58,346 INFO L79 Accepts]: Start accepts. Automaton has 1716 states and 2307 transitions. Word has length 77 [2025-04-29 10:50:58,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:58,346 INFO L485 AbstractCegarLoop]: Abstraction has 1716 states and 2307 transitions. [2025-04-29 10:50:58,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.19047619047619) internal successors, (172), 21 states have internal predecessors, (172), 0 states have call successors, (0), 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:58,346 INFO L278 IsEmpty]: Start isEmpty. Operand 1716 states and 2307 transitions. [2025-04-29 10:50:58,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-29 10:50:58,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:58,347 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:58,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 10:50:58,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:58,548 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:58,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:58,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1234392224, now seen corresponding path program 1 times [2025-04-29 10:50:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:58,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391316606] [2025-04-29 10:50:58,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:58,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 10:50:58,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 10:50:58,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:58,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 1 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:50:58,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:58,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391316606] [2025-04-29 10:50:58,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391316606] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:58,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467980733] [2025-04-29 10:50:58,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:58,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:58,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:58,920 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:50:58,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 10:50:58,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 10:50:59,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 10:50:59,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:59,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:59,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-29 10:50:59,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 1 proven. 64 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 10:50:59,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 10:51:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467980733] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:20,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:51:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2025-04-29 10:51:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084421760] [2025-04-29 10:51:20,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:20,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 10:51:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:51:20,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 10:51:20,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=649, Unknown=3, NotChecked=0, Total=756 [2025-04-29 10:51:20,760 INFO L87 Difference]: Start difference. First operand 1716 states and 2307 transitions. Second operand has 28 states, 28 states have (on average 6.75) internal successors, (189), 28 states have internal predecessors, (189), 0 states have call successors, (0), 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:23,282 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-29 10:51:30,074 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-29 10:51:31,926 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Killed by 15