./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/bitvector/byte_add_2-2.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_2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7aa965e8fcac12274a7daf616c8d6b34af27ca0f4ac4a0611856c85926887339 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:50:29,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:50:29,809 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,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:50:29,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:50:29,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:50:29,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:50:29,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:50:29,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:50:29,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:50:29,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:50:29,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:50:29,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:50:29,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:50:29,838 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:50:29,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:50:29,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:50:29,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:50:29,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:50:29,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:50:29,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:29,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:29,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:50:29,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:29,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:29,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:29,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:29,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:50:29,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:50:29,842 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:50:29,842 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:50:29,842 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:50:29,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:50:29,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:50:29,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:50:29,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:50:29,842 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 -> 7aa965e8fcac12274a7daf616c8d6b34af27ca0f4ac4a0611856c85926887339 [2025-04-29 10:50:30,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:50:30,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:50:30,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:50:30,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:50:30,062 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:50:30,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_2-2.c [2025-04-29 10:50:31,272 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0ab6109/046a222acefc4cf4b216edeefcccb9f4/FLAG2e927af0d [2025-04-29 10:50:31,498 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:50:31,502 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.c [2025-04-29 10:50:31,503 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,504 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,510 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0ab6109/046a222acefc4cf4b216edeefcccb9f4/FLAG2e927af0d [2025-04-29 10:50:32,323 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0ab6109/046a222acefc4cf4b216edeefcccb9f4 [2025-04-29 10:50:32,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:50:32,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:50:32,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:32,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:50:32,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:50:32,330 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,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c96124c 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,330 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,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:50:32,461 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_2-2.c[499,512] [2025-04-29 10:50:32,520 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:32,525 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:50:32,542 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_2-2.c[499,512] [2025-04-29 10:50:32,558 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:32,570 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:50:32,571 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,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:32,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:32,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:50:32,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:50:32,575 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,580 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,608 INFO L138 Inliner]: procedures = 8, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2025-04-29 10:50:32,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:32,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:50:32,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:50:32,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:50:32,616 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,616 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,617 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,626 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:50:32,626 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,626 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,630 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,631 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,633 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,635 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,635 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,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:50:32,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:50:32,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:50:32,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:50:32,640 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,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:32,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:32,668 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,671 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,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:50:32,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:50:32,736 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:50:32,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:50:32,969 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-04-29 10:50:32,970 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:50:32,979 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:50:32,980 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:50:32,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:32 BoogieIcfgContainer [2025-04-29 10:50:32,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:50:32,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:50:32,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:50:32,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:50:32,986 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:32,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31995f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:32, skipping insertion in model container [2025-04-29 10:50:32,987 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:32,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31995f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:32, skipping insertion in model container [2025-04-29 10:50:32,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:32" (3/3) ... [2025-04-29 10:50:32,988 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.c [2025-04-29 10:50:32,998 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:50:32,999 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_2-2.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,037 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:50:33,045 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;@b715293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:50:33,046 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:50:33,049 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,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 10:50:33,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,053 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,053 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1570190741, now seen corresponding path program 1 times [2025-04-29 10:50:33,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040718916] [2025-04-29 10:50:33,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:50:33,150 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,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:33,285 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,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:33,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040718916] [2025-04-29 10:50:33,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040718916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:33,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:50:33,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322917291] [2025-04-29 10:50:33,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:33,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:33,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:33,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:33,303 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,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:33,442 INFO L93 Difference]: Finished difference Result 115 states and 196 transitions. [2025-04-29 10:50:33,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:33,444 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,444 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:33,450 INFO L225 Difference]: With dead ends: 115 [2025-04-29 10:50:33,450 INFO L226 Difference]: Without dead ends: 70 [2025-04-29 10:50:33,452 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,453 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,454 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,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-29 10:50:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-04-29 10:50:33,472 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,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-04-29 10:50:33,476 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2025-04-29 10:50:33,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:33,477 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-04-29 10:50:33,477 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,477 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-04-29 10:50:33,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 10:50:33,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,478 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,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:50:33,478 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash 2007922496, now seen corresponding path program 1 times [2025-04-29 10:50:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493609113] [2025-04-29 10:50:33,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 10:50:33,514 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,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:33,656 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,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:33,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493609113] [2025-04-29 10:50:33,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493609113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:33,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:33,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:33,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389374739] [2025-04-29 10:50:33,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:33,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:33,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:33,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:33,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:33,659 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,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:33,829 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2025-04-29 10:50:33,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:33,829 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,830 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:33,830 INFO L225 Difference]: With dead ends: 164 [2025-04-29 10:50:33,830 INFO L226 Difference]: Without dead ends: 127 [2025-04-29 10:50:33,831 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,831 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,831 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,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-29 10:50:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2025-04-29 10:50:33,842 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,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2025-04-29 10:50:33,845 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2025-04-29 10:50:33,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:33,845 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2025-04-29 10:50:33,846 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,846 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2025-04-29 10:50:33,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-29 10:50:33,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:33,846 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,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:50:33,847 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:33,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:33,848 INFO L85 PathProgramCache]: Analyzing trace with hash -50508049, now seen corresponding path program 1 times [2025-04-29 10:50:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:33,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283131805] [2025-04-29 10:50:33,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:33,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:50:33,874 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,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:33,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:33,984 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:33,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:33,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283131805] [2025-04-29 10:50:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283131805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:33,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:33,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025633924] [2025-04-29 10:50:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:33,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:33,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:33,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:33,987 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,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,145 INFO L93 Difference]: Finished difference Result 234 states and 354 transitions. [2025-04-29 10:50:34,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:34,148 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,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,149 INFO L225 Difference]: With dead ends: 234 [2025-04-29 10:50:34,149 INFO L226 Difference]: Without dead ends: 156 [2025-04-29 10:50:34,149 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,150 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,150 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,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-04-29 10:50:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2025-04-29 10:50:34,160 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,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2025-04-29 10:50:34,162 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 27 [2025-04-29 10:50:34,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,162 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2025-04-29 10:50:34,163 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,163 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2025-04-29 10:50:34,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:50:34,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,164 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,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:50:34,165 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash -446870146, now seen corresponding path program 1 times [2025-04-29 10:50:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390149274] [2025-04-29 10:50:34,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:50:34,186 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,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,291 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,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390149274] [2025-04-29 10:50:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390149274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094046200] [2025-04-29 10:50:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:34,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:34,293 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,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,467 INFO L93 Difference]: Finished difference Result 255 states and 380 transitions. [2025-04-29 10:50:34,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:34,468 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,468 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,468 INFO L225 Difference]: With dead ends: 255 [2025-04-29 10:50:34,469 INFO L226 Difference]: Without dead ends: 176 [2025-04-29 10:50:34,470 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,471 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,471 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,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-04-29 10:50:34,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2025-04-29 10:50:34,480 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,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2025-04-29 10:50:34,481 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2025-04-29 10:50:34,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,481 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2025-04-29 10:50:34,481 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,481 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2025-04-29 10:50:34,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-29 10:50:34,481 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,481 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,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:50:34,481 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:34,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1153653824, now seen corresponding path program 1 times [2025-04-29 10:50:34,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:34,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038159381] [2025-04-29 10:50:34,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:34,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:50:34,499 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,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,587 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,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:34,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038159381] [2025-04-29 10:50:34,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038159381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:34,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281353389] [2025-04-29 10:50:34,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:34,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:34,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:34,590 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,592 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,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 10:50:34,650 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,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:34,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:34,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:50:34,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:50:34,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:34,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281353389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:34,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:34,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-04-29 10:50:34,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235893739] [2025-04-29 10:50:34,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:34,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:34,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:34,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:34,697 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:34,848 INFO L93 Difference]: Finished difference Result 230 states and 363 transitions. [2025-04-29 10:50:34,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:34,848 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-29 10:50:34,848 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:34,849 INFO L225 Difference]: With dead ends: 230 [2025-04-29 10:50:34,849 INFO L226 Difference]: Without dead ends: 154 [2025-04-29 10:50:34,850 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:34,850 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:34,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-29 10:50:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2025-04-29 10:50:34,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 137 states have internal predecessors, (196), 0 states have call successors, (0), 0 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,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2025-04-29 10:50:34,856 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 29 [2025-04-29 10:50:34,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:34,856 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2025-04-29 10:50:34,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:34,856 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2025-04-29 10:50:34,856 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-29 10:50:34,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:34,857 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-29 10:50:34,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:50:35,057 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:35,057 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2085856981, now seen corresponding path program 1 times [2025-04-29 10:50:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87548265] [2025-04-29 10:50:35,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:50:35,069 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,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:50:35,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87548265] [2025-04-29 10:50:35,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87548265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:35,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018889308] [2025-04-29 10:50:35,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:35,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:35,145 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,146 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,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 10:50:35,204 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,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:50:35,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:50:35,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018889308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:35,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:35,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-29 10:50:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61449557] [2025-04-29 10:50:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:35,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:35,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:35,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:35,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:50:35,232 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:35,372 INFO L93 Difference]: Finished difference Result 288 states and 427 transitions. [2025-04-29 10:50:35,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:35,373 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-29 10:50:35,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:35,373 INFO L225 Difference]: With dead ends: 288 [2025-04-29 10:50:35,374 INFO L226 Difference]: Without dead ends: 183 [2025-04-29 10:50:35,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:50:35,374 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:35,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-29 10:50:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2025-04-29 10:50:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 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,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2025-04-29 10:50:35,386 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 35 [2025-04-29 10:50:35,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:35,386 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2025-04-29 10:50:35,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:35,386 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2025-04-29 10:50:35,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-29 10:50:35,389 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:35,389 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:35,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:35,590 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,SelfDestructingSolverStorable5 [2025-04-29 10:50:35,590 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1735867674, now seen corresponding path program 1 times [2025-04-29 10:50:35,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239958006] [2025-04-29 10:50:35,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 10:50:35,601 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,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 10:50:35,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:35,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239958006] [2025-04-29 10:50:35,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239958006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:35,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:35,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:50:35,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543159052] [2025-04-29 10:50:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:35,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:35,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:35,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:35,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:50:35,674 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:35,897 INFO L93 Difference]: Finished difference Result 510 states and 708 transitions. [2025-04-29 10:50:35,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:50:35,897 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-29 10:50:35,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:35,899 INFO L225 Difference]: With dead ends: 510 [2025-04-29 10:50:35,899 INFO L226 Difference]: Without dead ends: 379 [2025-04-29 10:50:35,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:50:35,900 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 154 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:35,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 350 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:50:35,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-04-29 10:50:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 161. [2025-04-29 10:50:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 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,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2025-04-29 10:50:35,907 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 41 [2025-04-29 10:50:35,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:35,907 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2025-04-29 10:50:35,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:35,907 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2025-04-29 10:50:35,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 10:50:35,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:35,908 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:35,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:50:35,908 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:35,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -665618941, now seen corresponding path program 1 times [2025-04-29 10:50:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:35,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953142689] [2025-04-29 10:50:35,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:35,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 10:50:35,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:50:35,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:35,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 10:50:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:36,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953142689] [2025-04-29 10:50:36,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953142689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:36,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:36,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:50:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226089191] [2025-04-29 10:50:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:36,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:36,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:36,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:36,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:36,011 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:36,018 INFO L93 Difference]: Finished difference Result 289 states and 401 transitions. [2025-04-29 10:50:36,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:36,018 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-29 10:50:36,018 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:36,019 INFO L225 Difference]: With dead ends: 289 [2025-04-29 10:50:36,019 INFO L226 Difference]: Without dead ends: 148 [2025-04-29 10:50:36,019 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:36,020 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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:36,020 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 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:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-29 10:50:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-04-29 10:50:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 147 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 202 transitions. [2025-04-29 10:50:36,029 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 202 transitions. Word has length 42 [2025-04-29 10:50:36,029 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:36,029 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 202 transitions. [2025-04-29 10:50:36,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,030 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 202 transitions. [2025-04-29 10:50:36,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 10:50:36,032 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:36,032 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-04-29 10:50:36,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 10:50:36,032 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:36,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 423342123, now seen corresponding path program 1 times [2025-04-29 10:50:36,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:36,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267073062] [2025-04-29 10:50:36,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:36,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:36,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 10:50:36,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 10:50:36,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:36,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-29 10:50:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:36,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267073062] [2025-04-29 10:50:36,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267073062] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:36,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:36,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:50:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121156780] [2025-04-29 10:50:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:36,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:36,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:36,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:36,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:36,110 INFO L87 Difference]: Start difference. First operand 148 states and 202 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:36,123 INFO L93 Difference]: Finished difference Result 219 states and 295 transitions. [2025-04-29 10:50:36,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:36,123 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 48 [2025-04-29 10:50:36,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:36,124 INFO L225 Difference]: With dead ends: 219 [2025-04-29 10:50:36,124 INFO L226 Difference]: Without dead ends: 178 [2025-04-29 10:50:36,124 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:36,126 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:36,126 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:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-04-29 10:50:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-04-29 10:50:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.344632768361582) internal successors, (238), 177 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 238 transitions. [2025-04-29 10:50:36,135 INFO L79 Accepts]: Start accepts. Automaton has 178 states and 238 transitions. Word has length 48 [2025-04-29 10:50:36,135 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:36,135 INFO L485 AbstractCegarLoop]: Abstraction has 178 states and 238 transitions. [2025-04-29 10:50:36,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,136 INFO L278 IsEmpty]: Start isEmpty. Operand 178 states and 238 transitions. [2025-04-29 10:50:36,136 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 10:50:36,136 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:36,136 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-04-29 10:50:36,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 10:50:36,136 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:36,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash 350955565, now seen corresponding path program 1 times [2025-04-29 10:50:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:36,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857658561] [2025-04-29 10:50:36,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:36,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 10:50:36,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 10:50:36,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:36,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:50:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:36,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857658561] [2025-04-29 10:50:36,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857658561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:36,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043245866] [2025-04-29 10:50:36,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:36,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:36,292 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:36,294 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:36,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 10:50:36,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 10:50:36,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:36,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 10:50:36,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:36,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043245866] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 8 [2025-04-29 10:50:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417991225] [2025-04-29 10:50:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:36,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:36,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:36,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:36,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:50:36,375 INFO L87 Difference]: Start difference. First operand 178 states and 238 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:36,431 INFO L93 Difference]: Finished difference Result 354 states and 477 transitions. [2025-04-29 10:50:36,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:36,431 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 48 [2025-04-29 10:50:36,433 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:36,434 INFO L225 Difference]: With dead ends: 354 [2025-04-29 10:50:36,434 INFO L226 Difference]: Without dead ends: 169 [2025-04-29 10:50:36,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:50:36,435 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 26 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:36,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 114 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:36,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-04-29 10:50:36,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 136. [2025-04-29 10:50:36,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.325925925925926) internal successors, (179), 135 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 179 transitions. [2025-04-29 10:50:36,439 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 179 transitions. Word has length 48 [2025-04-29 10:50:36,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:36,439 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 179 transitions. [2025-04-29 10:50:36,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,440 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 179 transitions. [2025-04-29 10:50:36,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 10:50:36,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:36,440 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] [2025-04-29 10:50:36,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:36,641 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:36,641 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:36,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:36,642 INFO L85 PathProgramCache]: Analyzing trace with hash -793904116, now seen corresponding path program 1 times [2025-04-29 10:50:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:36,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163654529] [2025-04-29 10:50:36,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:36,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:36,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 10:50:36,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 10:50:36,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:36,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-04-29 10:50:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:36,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163654529] [2025-04-29 10:50:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163654529] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:36,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:36,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:50:36,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505281085] [2025-04-29 10:50:36,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:36,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:50:36,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:36,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:50:36,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:50:36,790 INFO L87 Difference]: Start difference. First operand 136 states and 179 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:36,865 INFO L93 Difference]: Finished difference Result 438 states and 575 transitions. [2025-04-29 10:50:36,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:50:36,865 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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 69 [2025-04-29 10:50:36,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:36,866 INFO L225 Difference]: With dead ends: 438 [2025-04-29 10:50:36,866 INFO L226 Difference]: Without dead ends: 318 [2025-04-29 10:50:36,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:50:36,867 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 162 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:36,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 205 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-29 10:50:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 204. [2025-04-29 10:50:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 203 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 270 transitions. [2025-04-29 10:50:36,874 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 270 transitions. Word has length 69 [2025-04-29 10:50:36,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:36,874 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 270 transitions. [2025-04-29 10:50:36,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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:36,875 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 270 transitions. [2025-04-29 10:50:36,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 10:50:36,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:36,875 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] [2025-04-29 10:50:36,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 10:50:36,876 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:36,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash -3711478, now seen corresponding path program 1 times [2025-04-29 10:50:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:36,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418775116] [2025-04-29 10:50:36,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:36,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 10:50:36,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 10:50:36,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:36,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 10:50:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:37,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418775116] [2025-04-29 10:50:37,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418775116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:37,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110575159] [2025-04-29 10:50:37,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:37,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:37,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:37,124 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:37,125 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:37,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 10:50:37,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 10:50:37,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:37,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:37,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-29 10:50:37,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-29 10:50:37,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-04-29 10:50:37,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110575159] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:37,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-29 10:50:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930058734] [2025-04-29 10:50:37,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:37,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 10:50:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:37,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 10:50:37,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-04-29 10:50:37,441 INFO L87 Difference]: Start difference. First operand 204 states and 270 transitions. Second operand has 17 states, 17 states have (on average 7.470588235294118) internal successors, (127), 17 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:38,137 INFO L93 Difference]: Finished difference Result 906 states and 1171 transitions. [2025-04-29 10:50:38,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-29 10:50:38,137 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.470588235294118) internal successors, (127), 17 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-04-29 10:50:38,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:38,142 INFO L225 Difference]: With dead ends: 906 [2025-04-29 10:50:38,142 INFO L226 Difference]: Without dead ends: 895 [2025-04-29 10:50:38,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=511, Invalid=1651, Unknown=0, NotChecked=0, Total=2162 [2025-04-29 10:50:38,145 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 450 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:38,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1008 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-04-29 10:50:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 377. [2025-04-29 10:50:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.3404255319148937) internal successors, (504), 376 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 504 transitions. [2025-04-29 10:50:38,169 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 504 transitions. Word has length 69 [2025-04-29 10:50:38,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:38,169 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 504 transitions. [2025-04-29 10:50:38,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.470588235294118) internal successors, (127), 17 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:38,170 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 504 transitions. [2025-04-29 10:50:38,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-29 10:50:38,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:38,171 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] [2025-04-29 10:50:38,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:38,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:38,372 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:38,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1100159044, now seen corresponding path program 1 times [2025-04-29 10:50:38,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:38,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307375873] [2025-04-29 10:50:38,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:38,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-29 10:50:38,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-29 10:50:38,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:38,490 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:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:38,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307375873] [2025-04-29 10:50:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307375873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:38,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:38,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:38,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148629112] [2025-04-29 10:50:38,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:38,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:38,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:38,492 INFO L87 Difference]: Start difference. First operand 377 states and 504 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:38,521 INFO L93 Difference]: Finished difference Result 388 states and 518 transitions. [2025-04-29 10:50:38,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:50:38,521 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 70 [2025-04-29 10:50:38,522 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:38,523 INFO L225 Difference]: With dead ends: 388 [2025-04-29 10:50:38,523 INFO L226 Difference]: Without dead ends: 380 [2025-04-29 10:50:38,524 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:38,524 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:38,525 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:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-04-29 10:50:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2025-04-29 10:50:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 1.339522546419098) internal successors, (505), 377 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 505 transitions. [2025-04-29 10:50:38,538 INFO L79 Accepts]: Start accepts. Automaton has 378 states and 505 transitions. Word has length 70 [2025-04-29 10:50:38,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:38,538 INFO L485 AbstractCegarLoop]: Abstraction has 378 states and 505 transitions. [2025-04-29 10:50:38,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:38,539 INFO L278 IsEmpty]: Start isEmpty. Operand 378 states and 505 transitions. [2025-04-29 10:50:38,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 10:50:38,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:38,540 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] [2025-04-29 10:50:38,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 10:50:38,540 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:38,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -591496221, now seen corresponding path program 1 times [2025-04-29 10:50:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:38,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897144885] [2025-04-29 10:50:38,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:38,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:38,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 10:50:38,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 10:50:38,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-29 10:50:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:38,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897144885] [2025-04-29 10:50:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897144885] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:38,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635701504] [2025-04-29 10:50:38,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:38,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:38,669 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:38,671 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:38,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 10:50:38,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 10:50:38,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:38,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:38,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-29 10:50:38,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:38,758 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 10:50:38,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 10:50:38,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635701504] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:38,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:38,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2025-04-29 10:50:38,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029706896] [2025-04-29 10:50:38,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:38,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 10:50:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:38,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 10:50:38,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:50:38,849 INFO L87 Difference]: Start difference. First operand 378 states and 505 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:39,451 INFO L93 Difference]: Finished difference Result 2061 states and 2940 transitions. [2025-04-29 10:50:39,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 10:50:39,452 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 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:39,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:39,456 INFO L225 Difference]: With dead ends: 2061 [2025-04-29 10:50:39,457 INFO L226 Difference]: Without dead ends: 1597 [2025-04-29 10:50:39,458 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2025-04-29 10:50:39,458 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 295 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:39,459 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 231 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-29 10:50:39,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-04-29 10:50:39,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1367. [2025-04-29 10:50:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1367 states, 1366 states have (on average 1.3206442166910688) internal successors, (1804), 1366 states have internal predecessors, (1804), 0 states have call successors, (0), 0 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:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1804 transitions. [2025-04-29 10:50:39,514 INFO L79 Accepts]: Start accepts. Automaton has 1367 states and 1804 transitions. Word has length 71 [2025-04-29 10:50:39,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:39,514 INFO L485 AbstractCegarLoop]: Abstraction has 1367 states and 1804 transitions. [2025-04-29 10:50:39,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:39,515 INFO L278 IsEmpty]: Start isEmpty. Operand 1367 states and 1804 transitions. [2025-04-29 10:50:39,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-04-29 10:50:39,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:39,518 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:39,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:39,723 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,SelfDestructingSolverStorable13 [2025-04-29 10:50:39,723 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:39,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1310497776, now seen corresponding path program 1 times [2025-04-29 10:50:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:39,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929790318] [2025-04-29 10:50:39,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:39,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-29 10:50:39,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-29 10:50:39,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:39,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:39,884 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-04-29 10:50:39,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:39,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929790318] [2025-04-29 10:50:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929790318] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:39,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 10:50:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188421263] [2025-04-29 10:50:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:39,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 10:50:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:39,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 10:50:39,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:50:39,885 INFO L87 Difference]: Start difference. First operand 1367 states and 1804 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 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,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:40,294 INFO L93 Difference]: Finished difference Result 3425 states and 4548 transitions. [2025-04-29 10:50:40,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:50:40,295 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 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:40,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:40,304 INFO L225 Difference]: With dead ends: 3425 [2025-04-29 10:50:40,304 INFO L226 Difference]: Without dead ends: 2422 [2025-04-29 10:50:40,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:50:40,306 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 380 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:40,306 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 328 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2025-04-29 10:50:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2234. [2025-04-29 10:50:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2233 states have (on average 1.2879534258844603) internal successors, (2876), 2233 states have internal predecessors, (2876), 0 states have call successors, (0), 0 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,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2876 transitions. [2025-04-29 10:50:40,409 INFO L79 Accepts]: Start accepts. Automaton has 2234 states and 2876 transitions. Word has length 71 [2025-04-29 10:50:40,409 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:40,409 INFO L485 AbstractCegarLoop]: Abstraction has 2234 states and 2876 transitions. [2025-04-29 10:50:40,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 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,410 INFO L278 IsEmpty]: Start isEmpty. Operand 2234 states and 2876 transitions. [2025-04-29 10:50:40,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-04-29 10:50:40,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:40,412 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:40,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 10:50:40,412 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:40,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1274383912, now seen corresponding path program 1 times [2025-04-29 10:50:40,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:40,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438270597] [2025-04-29 10:50:40,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:40,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 10:50:40,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:50:40,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:40,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:50:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:40,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438270597] [2025-04-29 10:50:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438270597] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:40,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222612939] [2025-04-29 10:50:40,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:40,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:40,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:40,608 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:40,609 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:40,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 10:50:41,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:50:41,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:41,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:41,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 10:50:41,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 64 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:50:41,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:41,329 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:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222612939] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:41,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:41,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-29 10:50:41,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431729649] [2025-04-29 10:50:41,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:41,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:50:41,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:41,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:50:41,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:50:41,331 INFO L87 Difference]: Start difference. First operand 2234 states and 2876 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:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:41,662 INFO L93 Difference]: Finished difference Result 4296 states and 5385 transitions. [2025-04-29 10:50:41,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:50:41,662 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:41,662 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:41,668 INFO L225 Difference]: With dead ends: 4296 [2025-04-29 10:50:41,668 INFO L226 Difference]: Without dead ends: 2090 [2025-04-29 10:50:41,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2025-04-29 10:50:41,671 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 301 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:41,671 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 644 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2025-04-29 10:50:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1530. [2025-04-29 10:50:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1529 states have (on average 1.250490516677567) internal successors, (1912), 1529 states have internal predecessors, (1912), 0 states have call successors, (0), 0 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,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1912 transitions. [2025-04-29 10:50:41,737 INFO L79 Accepts]: Start accepts. Automaton has 1530 states and 1912 transitions. Word has length 73 [2025-04-29 10:50:41,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:41,737 INFO L485 AbstractCegarLoop]: Abstraction has 1530 states and 1912 transitions. [2025-04-29 10:50:41,737 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:41,737 INFO L278 IsEmpty]: Start isEmpty. Operand 1530 states and 1912 transitions. [2025-04-29 10:50:41,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-04-29 10:50:41,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:41,739 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:41,745 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:41,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 10:50:41,943 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:41,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1360210280, now seen corresponding path program 2 times [2025-04-29 10:50:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:41,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143994629] [2025-04-29 10:50:41,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:41,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:41,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-04-29 10:50:41,970 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:41,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:41,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:42,230 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:42,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:42,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143994629] [2025-04-29 10:50:42,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143994629] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:42,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147548235] [2025-04-29 10:50:42,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:50:42,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:42,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:42,233 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:42,235 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:42,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-04-29 10:50:42,373 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:42,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:50:42,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:42,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 10:50:42,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 65 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:50:42,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:42,827 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:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147548235] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:42,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-04-29 10:50:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409444578] [2025-04-29 10:50:42,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:42,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:50:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:42,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:50:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:50:42,829 INFO L87 Difference]: Start difference. First operand 1530 states and 1912 transitions. Second operand has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:45,945 INFO L93 Difference]: Finished difference Result 7783 states and 9327 transitions. [2025-04-29 10:50:45,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-29 10:50:45,946 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 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:45,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:45,965 INFO L225 Difference]: With dead ends: 7783 [2025-04-29 10:50:45,965 INFO L226 Difference]: Without dead ends: 7772 [2025-04-29 10:50:45,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2544 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1401, Invalid=7911, Unknown=0, NotChecked=0, Total=9312 [2025-04-29 10:50:45,970 INFO L437 NwaCegarLoop]: 209 mSDtfsCounter, 929 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:45,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 2212 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-29 10:50:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7772 states. [2025-04-29 10:50:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7772 to 3427. [2025-04-29 10:50:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 3426 states have (on average 1.2784588441330997) internal successors, (4380), 3426 states have internal predecessors, (4380), 0 states have call successors, (0), 0 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,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 4380 transitions. [2025-04-29 10:50:46,117 INFO L79 Accepts]: Start accepts. Automaton has 3427 states and 4380 transitions. Word has length 73 [2025-04-29 10:50:46,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:46,117 INFO L485 AbstractCegarLoop]: Abstraction has 3427 states and 4380 transitions. [2025-04-29 10:50:46,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.956521739130435) internal successors, (206), 23 states have internal predecessors, (206), 0 states have call successors, (0), 0 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,117 INFO L278 IsEmpty]: Start isEmpty. Operand 3427 states and 4380 transitions. [2025-04-29 10:50:46,119 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-29 10:50:46,119 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:46,119 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:46,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:46,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:46,320 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:46,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2072449224, now seen corresponding path program 1 times [2025-04-29 10:50:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:46,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687956781] [2025-04-29 10:50:46,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:46,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-29 10:50:46,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-29 10:50:46,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:46,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:46,499 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:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:46,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687956781] [2025-04-29 10:50:46,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687956781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:46,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052838753] [2025-04-29 10:50:46,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:46,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:46,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:46,502 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:46,504 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:46,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-29 10:50:46,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-29 10:50:46,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:46,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:46,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 10:50:46,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 39 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:50:46,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:46,873 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:46,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052838753] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:46,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:46,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-29 10:50:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299538923] [2025-04-29 10:50:46,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:46,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 10:50:46,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:46,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 10:50:46,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:50:46,875 INFO L87 Difference]: Start difference. First operand 3427 states and 4380 transitions. Second operand has 16 states, 16 states have (on average 9.9375) internal successors, (159), 16 states have internal predecessors, (159), 0 states have call successors, (0), 0 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,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:48,084 INFO L93 Difference]: Finished difference Result 7879 states and 9817 transitions. [2025-04-29 10:50:48,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-29 10:50:48,085 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.9375) internal successors, (159), 16 states have internal predecessors, (159), 0 states have call successors, (0), 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:48,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:48,102 INFO L225 Difference]: With dead ends: 7879 [2025-04-29 10:50:48,102 INFO L226 Difference]: Without dead ends: 7874 [2025-04-29 10:50:48,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=642, Invalid=2114, Unknown=0, NotChecked=0, Total=2756 [2025-04-29 10:50:48,104 INFO L437 NwaCegarLoop]: 130 mSDtfsCounter, 731 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:48,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1215 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:50:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7874 states. [2025-04-29 10:50:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7874 to 4540. [2025-04-29 10:50:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4540 states, 4539 states have (on average 1.3287067636043182) internal successors, (6031), 4539 states have internal predecessors, (6031), 0 states have call successors, (0), 0 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,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 6031 transitions. [2025-04-29 10:50:48,277 INFO L79 Accepts]: Start accepts. Automaton has 4540 states and 6031 transitions. Word has length 74 [2025-04-29 10:50:48,277 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:48,277 INFO L485 AbstractCegarLoop]: Abstraction has 4540 states and 6031 transitions. [2025-04-29 10:50:48,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.9375) internal successors, (159), 16 states have internal predecessors, (159), 0 states have call successors, (0), 0 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,278 INFO L278 IsEmpty]: Start isEmpty. Operand 4540 states and 6031 transitions. [2025-04-29 10:50:48,279 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-29 10:50:48,279 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:48,279 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:48,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 10:50:48,480 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,SelfDestructingSolverStorable17 [2025-04-29 10:50:48,480 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:48,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1439011061, now seen corresponding path program 1 times [2025-04-29 10:50:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:48,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419276478] [2025-04-29 10:50:48,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:48,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:48,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 10:50:48,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:50:48,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:48,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:50:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:48,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419276478] [2025-04-29 10:50:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419276478] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:48,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495878799] [2025-04-29 10:50:48,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:48,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:48,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:48,932 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:48,934 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:48,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 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 75 of 75 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,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 10:50:49,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:49,394 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:49,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:49,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495878799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:49,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:50:49,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2025-04-29 10:50:49,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906437663] [2025-04-29 10:50:49,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:49,395 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:50:49,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:49,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:50:49,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:50:49,396 INFO L87 Difference]: Start difference. First operand 4540 states and 6031 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:49,570 INFO L93 Difference]: Finished difference Result 4564 states and 6063 transitions. [2025-04-29 10:50:49,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:50:49,571 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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 75 [2025-04-29 10:50:49,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:49,584 INFO L225 Difference]: With dead ends: 4564 [2025-04-29 10:50:49,586 INFO L226 Difference]: Without dead ends: 4559 [2025-04-29 10:50:49,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:50:49,589 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:49,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 169 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:50:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2025-04-29 10:50:49,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 4554. [2025-04-29 10:50:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 4553 states have (on average 1.3290138370305293) internal successors, (6051), 4553 states have internal predecessors, (6051), 0 states have call successors, (0), 0 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:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 6051 transitions. [2025-04-29 10:50:49,778 INFO L79 Accepts]: Start accepts. Automaton has 4554 states and 6051 transitions. Word has length 75 [2025-04-29 10:50:49,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:49,778 INFO L485 AbstractCegarLoop]: Abstraction has 4554 states and 6051 transitions. [2025-04-29 10:50:49,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 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:49,778 INFO L278 IsEmpty]: Start isEmpty. Operand 4554 states and 6051 transitions. [2025-04-29 10:50:49,780 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-04-29 10:50:49,780 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:49,780 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:49,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:49,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:49,981 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:49,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash 233932441, now seen corresponding path program 1 times [2025-04-29 10:50:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:49,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548722539] [2025-04-29 10:50:49,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:49,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 10:50:50,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:50:50,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:50,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 10:50:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:50:50,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548722539] [2025-04-29 10:50:50,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548722539] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:50:50,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401482594] [2025-04-29 10:50:50,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:50,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:50,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:50,401 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:50,403 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:50,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-29 10:50:50,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:50:50,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:50,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:50,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 10:50:50,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:50,720 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:50,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:50:50,966 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:50,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401482594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:50:50,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:50:50,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 25 [2025-04-29 10:50:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376081951] [2025-04-29 10:50:50,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:50:50,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 10:50:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:50:50,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 10:50:50,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2025-04-29 10:50:50,968 INFO L87 Difference]: Start difference. First operand 4554 states and 6051 transitions. Second operand has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:53,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:53,021 INFO L93 Difference]: Finished difference Result 10420 states and 13348 transitions. [2025-04-29 10:50:53,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-29 10:50:53,021 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 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:53,021 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:53,034 INFO L225 Difference]: With dead ends: 10420 [2025-04-29 10:50:53,034 INFO L226 Difference]: Without dead ends: 10398 [2025-04-29 10:50:53,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1017, Invalid=4835, Unknown=0, NotChecked=0, Total=5852 [2025-04-29 10:50:53,036 INFO L437 NwaCegarLoop]: 174 mSDtfsCounter, 581 mSDsluCounter, 2219 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:53,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 2393 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-29 10:50:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10398 states. [2025-04-29 10:50:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10398 to 5738. [2025-04-29 10:50:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5738 states, 5737 states have (on average 1.326651560048806) internal successors, (7611), 5737 states have internal predecessors, (7611), 0 states have call successors, (0), 0 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:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5738 states to 5738 states and 7611 transitions. [2025-04-29 10:50:53,260 INFO L79 Accepts]: Start accepts. Automaton has 5738 states and 7611 transitions. Word has length 75 [2025-04-29 10:50:53,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:53,260 INFO L485 AbstractCegarLoop]: Abstraction has 5738 states and 7611 transitions. [2025-04-29 10:50:53,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.44) internal successors, (186), 25 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:53,260 INFO L278 IsEmpty]: Start isEmpty. Operand 5738 states and 7611 transitions. [2025-04-29 10:50:53,262 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-04-29 10:50:53,262 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:53,262 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, 1] [2025-04-29 10:50:53,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 10:50:53,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:53,465 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:53,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1595439096, now seen corresponding path program 1 times [2025-04-29 10:50:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:50:53,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6555952] [2025-04-29 10:50:53,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:50:53,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 10:50:53,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 10:50:53,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:53,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 10:50:53,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 10:50:53,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-29 10:50:53,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-29 10:50:53,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:53,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 10:50:53,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 10:50:53,545 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 10:50:53,545 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-29 10:50:53,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 10:50:53,548 INFO L422 BasicCegarLoop]: Path program histogram: [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:53,625 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:50:53,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:50:53 BoogieIcfgContainer [2025-04-29 10:50:53,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:50:53,628 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:50:53,628 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:50:53,628 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:50:53,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:32" (3/4) ... [2025-04-29 10:50:53,633 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 10:50:53,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:50:53,634 INFO L158 Benchmark]: Toolchain (without parser) took 21308.06ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 133.4MB in the beginning and 319.4MB in the end (delta: -186.1MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2025-04-29 10:50:53,634 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:50:53,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.91ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 117.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:50:53,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.74ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 114.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:50:53,635 INFO L158 Benchmark]: Boogie Preprocessor took 29.58ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 111.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 10:50:53,635 INFO L158 Benchmark]: RCFGBuilder took 340.60ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 90.3MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:50:53,636 INFO L158 Benchmark]: TraceAbstraction took 20645.70ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 89.9MB in the beginning and 319.5MB in the end (delta: -229.7MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2025-04-29 10:50:53,636 INFO L158 Benchmark]: Witness Printer took 5.77ms. Allocated memory is still 453.0MB. Free memory was 319.5MB in the beginning and 319.4MB in the end (delta: 133.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:50:53,637 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.91ms. Allocated memory is still 167.8MB. Free memory was 133.4MB in the beginning and 117.5MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.74ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 114.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.58ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 111.9MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 340.60ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 90.3MB in the end (delta: 21.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20645.70ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 89.9MB in the beginning and 319.5MB in the end (delta: -229.7MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * Witness Printer took 5.77ms. Allocated memory is still 453.0MB. Free memory was 319.5MB in the beginning and 319.4MB in the end (delta: 133.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 107, overapproximation of bitwiseOr at line 107. Possible FailurePath: [L115] unsigned int a, b, r; [L117] a = __VERIFIER_nondet_uint() [L118] b = 234770789 [L120] CALL, EXPR mp_add(a, b) [L25] unsigned char a0, a1, a2, a3; [L26] unsigned char b0, b1, b2, b3; [L27] unsigned char r0, r1, r2, r3; [L29] unsigned short carry; [L30] unsigned short partial_sum; [L31] unsigned int r; [L32] unsigned char i; [L33] unsigned char na, nb; [L35] a0 = a [L36] a1 = a >> 8 [L37] a2 = a >> 16U [L38] a3 = a >> 24U [L40] b0 = b [L41] b1 = b >> 8U [L42] b2 = b >> 16U [L43] b3 = b >> 24U [L45] na = (unsigned char)4 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=4] [L46] COND TRUE a3 == (unsigned char)0 [L47] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=3] [L48] COND TRUE a2 == (unsigned char)0 [L49] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=2] [L50] COND TRUE a1 == (unsigned char)0 [L51] na = na - 1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1] [L56] nb = (unsigned char)4 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L57] COND FALSE !(b3 == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, na=1, nb=4] [L67] carry = (unsigned short)0 [L68] i = (unsigned char)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4] [L69] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L70] partial_sum = carry [L71] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L73] COND TRUE i < na VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=0] [L74] COND TRUE i == (unsigned char)0 [L74] partial_sum = partial_sum + a0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L75] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L76] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L77] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L79] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=155] [L80] COND TRUE i == (unsigned char)0 [L80] partial_sum = partial_sum + b0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L81] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L82] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L83] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=0, na=1, nb=4, partial_sum=256] [L85] COND TRUE partial_sum > ((unsigned char)255) [L86] partial_sum = partial_sum & ((unsigned char)255) [L87] carry = (unsigned short)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0] [L90] COND TRUE i == (unsigned char)0 [L90] r0 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L95] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L69] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L70] partial_sum = carry [L71] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L73] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L79] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L80] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L81] COND TRUE i == (unsigned char)1 [L81] partial_sum = partial_sum + b1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L85] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0] [L91] COND TRUE i == (unsigned char)1 [L91] r1 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=1, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L95] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=82, r0=0, r1=82] [L69] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L70] partial_sum = carry [L71] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L73] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L79] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L80] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L81] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=82] [L82] COND TRUE i == (unsigned char)2 [L82] partial_sum = partial_sum + b2 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L83] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L85] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82] [L92] COND TRUE i == (unsigned char)2 [L92] r2 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=2, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L95] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=254, r0=0, r1=82, r2=254] [L69] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L70] partial_sum = carry [L71] carry = (unsigned short)0 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L73] COND FALSE !(i < na) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L79] COND TRUE i < nb VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L80] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L81] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L82] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i == (unsigned char)3 [L83] partial_sum = partial_sum + b3 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L85] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L90] COND FALSE !(i == (unsigned char)0) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, partial_sum=13, r0=0, r1=82, r2=254] [L93] COND TRUE i == (unsigned char)3 [L93] r3 = (unsigned char)partial_sum VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=3, na=1, nb=4, r0=0, r1=82, r2=254, r3=13] [L95] i = i + (unsigned char)1 VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, carry=0, i=4, na=1, nb=4, r0=0, r1=82, r2=254, r3=13] [L69] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, i=4, r0=0, r1=82, r2=254, r3=13] [L98] COND FALSE !(i < (unsigned char)4) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r0=0, r1=82, r2=254, r3=13] [L107] EXPR r0 | (r1 << 8U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r2=254, r3=13] [L107] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13, r3=13] [L107] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13] [L107] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L109] return r; VAL [\result=218103808, a0=-4294967141, a1=0, a2=0, a3=0, b0=234770789, b1=917073, b2=3582, b3=13] [L120] RET, EXPR mp_add(a, b) [L120] r = mp_add(a, b) [L122] CALL __VERIFIER_assert(r == a + b) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 84 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.5s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4416 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4416 mSDsluCounter, 10200 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8452 mSDsCounter, 360 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7486 IncrementalHoareTripleChecker+Invalid, 7846 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 360 mSolverCounterUnsat, 1748 mSDtfsCounter, 7486 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1404 GetRequests, 1020 SyntacticMatches, 3 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5230 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5738occurred in iteration=20, InterpolantAutomatonStates: 308, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 14407 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2075 ConstructedInterpolants, 0 QuantifiedInterpolants, 12229 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1614 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 36 InterpolantComputations, 14 PerfectInterpolantSequences, 1240/2107 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 10:50:53,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/bitvector/byte_add_2-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7aa965e8fcac12274a7daf616c8d6b34af27ca0f4ac4a0611856c85926887339 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:50:55,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:50:55,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-04-29 10:50:55,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:50:55,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:50:55,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:50:55,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:50:55,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:50:55,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:50:55,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:50:55,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:50:55,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:50:55,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:50:55,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:55,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:50:55,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:55,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:50:55,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:50:55,628 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:50:55,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:50:55,628 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 10:50:55,628 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 10:50:55,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:50:55,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:50:55,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:50:55,629 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 -> 7aa965e8fcac12274a7daf616c8d6b34af27ca0f4ac4a0611856c85926887339 [2025-04-29 10:50:55,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:50:55,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:50:55,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:50:55,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:50:55,911 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:50:55,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_2-2.c [2025-04-29 10:50:57,206 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdca10367/7f872e69e39640faa9939e841ce43282/FLAG45b83f7ff [2025-04-29 10:50:57,365 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:50:57,365 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_2-2.c [2025-04-29 10:50:57,368 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:57,368 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:57,373 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdca10367/7f872e69e39640faa9939e841ce43282/FLAG45b83f7ff [2025-04-29 10:50:58,406 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdca10367/7f872e69e39640faa9939e841ce43282 [2025-04-29 10:50:58,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:50:58,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:50:58,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:58,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:50:58,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:50:58,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:50:58" (1/1) ... [2025-04-29 10:50:58,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5155ee9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:58, skipping insertion in model container [2025-04-29 10:50:58,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:50:58" (1/1) ... [2025-04-29 10:50:58,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:50:58,534 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_2-2.c[499,512] [2025-04-29 10:50:58,568 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:58,573 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:50:58,587 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_2-2.c[499,512] [2025-04-29 10:50:58,617 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:50:58,634 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:50:58,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:58 WrapperNode [2025-04-29 10:50:58,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:50:58,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:58,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:50:58,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:50:58,641 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:58" (1/1) ... [2025-04-29 10:50:58,646 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:58" (1/1) ... [2025-04-29 10:50:58,667 INFO L138 Inliner]: procedures = 8, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2025-04-29 10:50:58,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:50:58,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:50:58,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:50:58,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:50:58,675 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:58" (1/1) ... [2025-04-29 10:50:58,675 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:58" (1/1) ... [2025-04-29 10:50:58,682 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:58" (1/1) ... [2025-04-29 10:50:58,687 INFO L175 MemorySlicer]: No memory access in input program. [2025-04-29 10:50:58,688 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:58" (1/1) ... [2025-04-29 10:50:58,688 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:58" (1/1) ... [2025-04-29 10:50:58,691 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:58" (1/1) ... [2025-04-29 10:50:58,692 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:58" (1/1) ... [2025-04-29 10:50:58,695 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:58" (1/1) ... [2025-04-29 10:50:58,696 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:58" (1/1) ... [2025-04-29 10:50:58,696 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:58" (1/1) ... [2025-04-29 10:50:58,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:50:58,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:50:58,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:50:58,699 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:50:58,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:58" (1/1) ... [2025-04-29 10:50:58,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:50:58,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:58,726 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:58,727 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:58,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:50:58,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:50:58,787 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:50:58,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:50:58,946 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-04-29 10:50:58,946 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:50:58,955 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:50:58,955 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:50:58,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:58 BoogieIcfgContainer [2025-04-29 10:50:58,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:50:58,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:50:58,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:50:58,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:50:58,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:50:58" (1/3) ... [2025-04-29 10:50:58,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28249152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:58, skipping insertion in model container [2025-04-29 10:50:58,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:50:58" (2/3) ... [2025-04-29 10:50:58,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28249152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:50:58, skipping insertion in model container [2025-04-29 10:50:58,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:50:58" (3/3) ... [2025-04-29 10:50:58,962 INFO L128 eAbstractionObserver]: Analyzing ICFG byte_add_2-2.c [2025-04-29 10:50:58,980 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:50:58,982 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG byte_add_2-2.c that has 1 procedures, 41 locations, 68 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-29 10:50:59,041 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:50:59,049 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;@6f79a5c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:50:59,049 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:50:59,052 INFO L278 IsEmpty]: Start isEmpty. Operand has 41 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:59,055 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 10:50:59,056 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:59,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:59,056 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:59,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1659265626, now seen corresponding path program 1 times [2025-04-29 10:50:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:59,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19052121] [2025-04-29 10:50:59,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:59,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:59,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:59,070 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:59,071 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:59,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 10:50:59,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 10:50:59,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:59,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:59,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 10:50:59,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:59,172 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:59,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:59,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:50:59,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19052121] [2025-04-29 10:50:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19052121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:59,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:59,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:50:59,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80308831] [2025-04-29 10:50:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:59,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:50:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:50:59,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:50:59,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:50:59,195 INFO L87 Difference]: Start difference. First operand has 41 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:59,339 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2025-04-29 10:50:59,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:50:59,342 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 10:50:59,342 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:59,346 INFO L225 Difference]: With dead ends: 95 [2025-04-29 10:50:59,347 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 10:50:59,349 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:59,353 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:59,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 64 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 10:50:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-04-29 10:50:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.543859649122807) internal successors, (88), 57 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2025-04-29 10:50:59,384 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 88 transitions. Word has length 11 [2025-04-29 10:50:59,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:59,384 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 88 transitions. [2025-04-29 10:50:59,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:59,385 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 88 transitions. [2025-04-29 10:50:59,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 10:50:59,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:59,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:59,393 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:59,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:59,587 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:50:59,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:50:59,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1808952529, now seen corresponding path program 1 times [2025-04-29 10:50:59,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:50:59,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623537026] [2025-04-29 10:50:59,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:50:59,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:50:59,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:50:59,591 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:59,592 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:59,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 10:50:59,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 10:50:59,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:50:59,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:50:59,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:50:59,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:50:59,674 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:59,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:50:59,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:50:59,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623537026] [2025-04-29 10:50:59,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623537026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:50:59,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:50:59,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:50:59,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711931893] [2025-04-29 10:50:59,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:50:59,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:50:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:50:59,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:50:59,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:50:59,675 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:50:59,820 INFO L93 Difference]: Finished difference Result 157 states and 245 transitions. [2025-04-29 10:50:59,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:50:59,821 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 10:50:59,821 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:50:59,822 INFO L225 Difference]: With dead ends: 157 [2025-04-29 10:50:59,822 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 10:50:59,823 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:59,823 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:50:59,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 147 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:50:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 10:50:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-04-29 10:50:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.5242718446601942) internal successors, (157), 103 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:59,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2025-04-29 10:50:59,836 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 17 [2025-04-29 10:50:59,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:50:59,836 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2025-04-29 10:50:59,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:50:59,836 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2025-04-29 10:50:59,837 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 10:50:59,837 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:50:59,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:50:59,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 10:51:00,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,042 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:00,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:00,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1386085553, now seen corresponding path program 1 times [2025-04-29 10:51:00,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:00,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80475743] [2025-04-29 10:51:00,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:00,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:00,045 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:51:00,046 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:51:00,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 10:51:00,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 10:51:00,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:00,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:00,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:51:00,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:00,103 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:51:00,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:51:00,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:00,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80475743] [2025-04-29 10:51:00,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80475743] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:00,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:00,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:51:00,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349589794] [2025-04-29 10:51:00,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:00,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:51:00,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:00,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:51:00,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:51:00,104 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:00,221 INFO L93 Difference]: Finished difference Result 285 states and 434 transitions. [2025-04-29 10:51:00,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:51:00,223 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-29 10:51:00,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:00,224 INFO L225 Difference]: With dead ends: 285 [2025-04-29 10:51:00,224 INFO L226 Difference]: Without dead ends: 198 [2025-04-29 10:51:00,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:51:00,225 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 41 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:00,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 145 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:51:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-04-29 10:51:00,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 181. [2025-04-29 10:51:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.511111111111111) internal successors, (272), 180 states have internal predecessors, (272), 0 states have call successors, (0), 0 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:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 272 transitions. [2025-04-29 10:51:00,242 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 272 transitions. Word has length 18 [2025-04-29 10:51:00,242 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:00,242 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 272 transitions. [2025-04-29 10:51:00,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:00,242 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 272 transitions. [2025-04-29 10:51:00,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 10:51:00,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:00,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:51:00,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:51:00,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,443 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:00,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:00,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1894204574, now seen corresponding path program 1 times [2025-04-29 10:51:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:00,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20519258] [2025-04-29 10:51:00,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:00,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:00,446 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:51:00,447 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:51:00,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 10:51:00,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 10:51:00,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:00,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:00,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:51:00,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:51:00,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:51:00,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:00,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20519258] [2025-04-29 10:51:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20519258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:00,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:00,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:51:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052162452] [2025-04-29 10:51:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:00,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:51:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:00,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:51:00,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:51:00,489 INFO L87 Difference]: Start difference. First operand 181 states and 272 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:00,500 INFO L93 Difference]: Finished difference Result 186 states and 276 transitions. [2025-04-29 10:51:00,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:51:00,500 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-29 10:51:00,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:00,501 INFO L225 Difference]: With dead ends: 186 [2025-04-29 10:51:00,501 INFO L226 Difference]: Without dead ends: 91 [2025-04-29 10:51:00,501 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:51:00,501 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 49 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:51:00,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:51:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-29 10:51:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-29 10:51:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-04-29 10:51:00,506 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 19 [2025-04-29 10:51:00,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:00,507 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-04-29 10:51:00,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:00,507 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-04-29 10:51:00,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:51:00,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:00,507 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] [2025-04-29 10:51:00,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:51:00,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,708 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:00,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1777837642, now seen corresponding path program 1 times [2025-04-29 10:51:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:00,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454023458] [2025-04-29 10:51:00,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:00,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:00,711 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:51:00,712 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:51:00,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:51:00,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:51:00,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:00,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:00,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-29 10:51:00,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:00,764 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:51:00,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:51:00,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:00,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454023458] [2025-04-29 10:51:00,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454023458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:00,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:00,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:51:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105344176] [2025-04-29 10:51:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:00,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:51:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:00,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:51:00,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:51:00,765 INFO L87 Difference]: Start difference. First operand 91 states and 131 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:51:00,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:00,776 INFO L93 Difference]: Finished difference Result 118 states and 167 transitions. [2025-04-29 10:51:00,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:51:00,777 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 25 [2025-04-29 10:51:00,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:00,777 INFO L225 Difference]: With dead ends: 118 [2025-04-29 10:51:00,777 INFO L226 Difference]: Without dead ends: 113 [2025-04-29 10:51:00,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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:51:00,778 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 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:51:00,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:51:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-29 10:51:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-29 10:51:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.4375) internal successors, (161), 112 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:51:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-04-29 10:51:00,787 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 25 [2025-04-29 10:51:00,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:00,787 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-04-29 10:51:00,787 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:51:00,787 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-04-29 10:51:00,787 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 10:51:00,787 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:00,787 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] [2025-04-29 10:51:00,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 10:51:00,988 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,988 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:00,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:00,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1816065076, now seen corresponding path program 1 times [2025-04-29 10:51:00,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:00,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101275378] [2025-04-29 10:51:00,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:00,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:00,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:00,990 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:51:00,991 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:51:01,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 10:51:01,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:51:01,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:01,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:01,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 10:51:01,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:01,057 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:51:01,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:51:01,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:01,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101275378] [2025-04-29 10:51:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101275378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:01,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:01,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:51:01,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006806982] [2025-04-29 10:51:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:01,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:51:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:01,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:51:01,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:51:01,061 INFO L87 Difference]: Start difference. First operand 113 states and 161 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:51:01,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:01,140 INFO L93 Difference]: Finished difference Result 218 states and 310 transitions. [2025-04-29 10:51:01,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:51:01,140 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 25 [2025-04-29 10:51:01,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:01,141 INFO L225 Difference]: With dead ends: 218 [2025-04-29 10:51:01,141 INFO L226 Difference]: Without dead ends: 170 [2025-04-29 10:51:01,142 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:51:01,143 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 101 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:01,143 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 204 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:51:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-04-29 10:51:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 118. [2025-04-29 10:51:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 166 transitions. [2025-04-29 10:51:01,153 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 166 transitions. Word has length 25 [2025-04-29 10:51:01,153 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:01,153 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 166 transitions. [2025-04-29 10:51:01,153 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:51:01,153 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 166 transitions. [2025-04-29 10:51:01,154 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 10:51:01,154 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:01,156 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] [2025-04-29 10:51:01,161 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:51:01,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:01,360 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:01,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 93730485, now seen corresponding path program 1 times [2025-04-29 10:51:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:01,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143836035] [2025-04-29 10:51:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:01,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:01,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:01,362 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:51:01,363 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:51:01,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 10:51:01,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 10:51:01,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:01,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:01,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:51:01,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:01,429 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:51:01,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:51:01,429 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:01,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143836035] [2025-04-29 10:51:01,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143836035] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:01,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:01,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 10:51:01,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134488905] [2025-04-29 10:51:01,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:01,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:51:01,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:01,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:51:01,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:51:01,431 INFO L87 Difference]: Start difference. First operand 118 states and 166 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:01,600 INFO L93 Difference]: Finished difference Result 264 states and 375 transitions. [2025-04-29 10:51:01,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:51:01,601 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 10:51:01,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:01,602 INFO L225 Difference]: With dead ends: 264 [2025-04-29 10:51:01,602 INFO L226 Difference]: Without dead ends: 216 [2025-04-29 10:51:01,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:51:01,603 INFO L437 NwaCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:01,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 496 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 10:51:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-29 10:51:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 163. [2025-04-29 10:51:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4135802469135803) internal successors, (229), 162 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 229 transitions. [2025-04-29 10:51:01,613 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 229 transitions. Word has length 26 [2025-04-29 10:51:01,613 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:01,613 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 229 transitions. [2025-04-29 10:51:01,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:01,613 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 229 transitions. [2025-04-29 10:51:01,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-29 10:51:01,614 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:01,614 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] [2025-04-29 10:51:01,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 10:51:01,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:01,814 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:01,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash 312585203, now seen corresponding path program 1 times [2025-04-29 10:51:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:01,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530625219] [2025-04-29 10:51:01,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:01,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:01,818 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:51:01,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 10:51:01,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 10:51:01,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 10:51:01,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:01,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:01,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 10:51:01,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:01,896 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:51:01,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:51:01,898 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:01,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530625219] [2025-04-29 10:51:01,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530625219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:01,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:01,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:51:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736197950] [2025-04-29 10:51:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:01,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:51:01,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:01,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:51:01,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:51:01,898 INFO L87 Difference]: Start difference. First operand 163 states and 229 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:02,035 INFO L93 Difference]: Finished difference Result 263 states and 372 transitions. [2025-04-29 10:51:02,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:51:02,036 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-29 10:51:02,036 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:02,036 INFO L225 Difference]: With dead ends: 263 [2025-04-29 10:51:02,036 INFO L226 Difference]: Without dead ends: 215 [2025-04-29 10:51:02,037 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:51:02,037 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 118 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:02,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 297 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:51:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-29 10:51:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2025-04-29 10:51:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4203821656050954) internal successors, (223), 157 states have internal predecessors, (223), 0 states have call successors, (0), 0 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:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 223 transitions. [2025-04-29 10:51:02,042 INFO L79 Accepts]: Start accepts. Automaton has 158 states and 223 transitions. Word has length 26 [2025-04-29 10:51:02,042 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:02,043 INFO L485 AbstractCegarLoop]: Abstraction has 158 states and 223 transitions. [2025-04-29 10:51:02,043 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:02,043 INFO L278 IsEmpty]: Start isEmpty. Operand 158 states and 223 transitions. [2025-04-29 10:51:02,043 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:51:02,043 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:02,043 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] [2025-04-29 10:51:02,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-29 10:51:02,243 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 [2025-04-29 10:51:02,244 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:02,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1997773630, now seen corresponding path program 1 times [2025-04-29 10:51:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:02,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [315787250] [2025-04-29 10:51:02,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:02,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:02,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:02,246 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:51:02,246 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:51:02,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:51:02,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:51:02,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:02,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:02,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:51:02,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:02,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:02,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:02,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315787250] [2025-04-29 10:51:02,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315787250] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:02,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:51:02,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-04-29 10:51:02,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265415145] [2025-04-29 10:51:02,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:02,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:51:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:02,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:51:02,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:51:02,349 INFO L87 Difference]: Start difference. First operand 158 states and 223 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:02,510 INFO L93 Difference]: Finished difference Result 602 states and 909 transitions. [2025-04-29 10:51:02,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:51:02,510 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 10:51:02,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:02,511 INFO L225 Difference]: With dead ends: 602 [2025-04-29 10:51:02,511 INFO L226 Difference]: Without dead ends: 444 [2025-04-29 10:51:02,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:51:02,512 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 114 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:02,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 60 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:51:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-04-29 10:51:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 334. [2025-04-29 10:51:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.4804804804804805) internal successors, (493), 333 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 493 transitions. [2025-04-29 10:51:02,525 INFO L79 Accepts]: Start accepts. Automaton has 334 states and 493 transitions. Word has length 28 [2025-04-29 10:51:02,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:02,525 INFO L485 AbstractCegarLoop]: Abstraction has 334 states and 493 transitions. [2025-04-29 10:51:02,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:51:02,526 INFO L278 IsEmpty]: Start isEmpty. Operand 334 states and 493 transitions. [2025-04-29 10:51:02,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-29 10:51:02,527 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:02,527 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] [2025-04-29 10:51:02,532 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:51:02,727 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 [2025-04-29 10:51:02,728 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:02,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:02,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1262820800, now seen corresponding path program 1 times [2025-04-29 10:51:02,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:02,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1377056805] [2025-04-29 10:51:02,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:02,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:02,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:02,730 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:51:02,731 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:51:02,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 10:51:02,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 10:51:02,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:02,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:02,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:51:02,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 10:51:02,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:51:02,799 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:02,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377056805] [2025-04-29 10:51:02,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377056805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:51:02,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:51:02,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:51:02,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450544719] [2025-04-29 10:51:02,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:51:02,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:51:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:02,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:51:02,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:51:02,800 INFO L87 Difference]: Start difference. First operand 334 states and 493 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:02,861 INFO L93 Difference]: Finished difference Result 904 states and 1335 transitions. [2025-04-29 10:51:02,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:51:02,861 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 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 64 [2025-04-29 10:51:02,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:02,863 INFO L225 Difference]: With dead ends: 904 [2025-04-29 10:51:02,863 INFO L226 Difference]: Without dead ends: 592 [2025-04-29 10:51:02,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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:51:02,864 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 144 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:51:02,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 144 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:51:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-04-29 10:51:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 474. [2025-04-29 10:51:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.5052854122621564) internal successors, (712), 473 states have internal predecessors, (712), 0 states have call successors, (0), 0 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:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 712 transitions. [2025-04-29 10:51:02,891 INFO L79 Accepts]: Start accepts. Automaton has 474 states and 712 transitions. Word has length 64 [2025-04-29 10:51:02,891 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:02,891 INFO L485 AbstractCegarLoop]: Abstraction has 474 states and 712 transitions. [2025-04-29 10:51:02,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 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:02,891 INFO L278 IsEmpty]: Start isEmpty. Operand 474 states and 712 transitions. [2025-04-29 10:51:02,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-29 10:51:02,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:02,893 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2025-04-29 10:51:02,899 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:51:03,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:03,094 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:03,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1396834306, now seen corresponding path program 2 times [2025-04-29 10:51:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:03,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509881953] [2025-04-29 10:51:03,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:51:03,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:03,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:03,097 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:51:03,097 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:51:03,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-04-29 10:51:03,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 10:51:03,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:51:03,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:03,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-29 10:51:03,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 19 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:51:03,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 22 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:03,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:03,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509881953] [2025-04-29 10:51:03,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509881953] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:03,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:51:03,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2025-04-29 10:51:03,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131662671] [2025-04-29 10:51:03,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:03,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 10:51:03,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:03,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 10:51:03,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-04-29 10:51:03,460 INFO L87 Difference]: Start difference. First operand 474 states and 712 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:03,672 INFO L93 Difference]: Finished difference Result 1053 states and 1613 transitions. [2025-04-29 10:51:03,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:51:03,672 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 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 64 [2025-04-29 10:51:03,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:03,675 INFO L225 Difference]: With dead ends: 1053 [2025-04-29 10:51:03,675 INFO L226 Difference]: Without dead ends: 592 [2025-04-29 10:51:03,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:51:03,676 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 181 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:03,676 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 88 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:51:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-04-29 10:51:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 519. [2025-04-29 10:51:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.4015444015444016) internal successors, (726), 518 states have internal predecessors, (726), 0 states have call successors, (0), 0 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:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 726 transitions. [2025-04-29 10:51:03,697 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 726 transitions. Word has length 64 [2025-04-29 10:51:03,697 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:03,697 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 726 transitions. [2025-04-29 10:51:03,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:03,697 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 726 transitions. [2025-04-29 10:51:03,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-29 10:51:03,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:03,698 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] [2025-04-29 10:51:03,704 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:51:03,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:03,899 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:03,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash -566037006, now seen corresponding path program 1 times [2025-04-29 10:51:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:03,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [133084887] [2025-04-29 10:51:03,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:03,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:03,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:03,901 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:51:03,903 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:51:03,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-29 10:51:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-29 10:51:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:03,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 10:51:03,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 10:51:03,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 46 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 10:51:04,038 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:04,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133084887] [2025-04-29 10:51:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133084887] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:04,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:51:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-04-29 10:51:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232395885] [2025-04-29 10:51:04,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:04,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:51:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:04,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:51:04,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:51:04,039 INFO L87 Difference]: Start difference. First operand 519 states and 726 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:04,378 INFO L93 Difference]: Finished difference Result 1391 states and 1974 transitions. [2025-04-29 10:51:04,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:51:04,379 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 68 [2025-04-29 10:51:04,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:04,381 INFO L225 Difference]: With dead ends: 1391 [2025-04-29 10:51:04,381 INFO L226 Difference]: Without dead ends: 884 [2025-04-29 10:51:04,382 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-04-29 10:51:04,382 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 236 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:04,383 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 139 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 10:51:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-04-29 10:51:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 831. [2025-04-29 10:51:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.3240963855421686) internal successors, (1099), 830 states have internal predecessors, (1099), 0 states have call successors, (0), 0 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:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1099 transitions. [2025-04-29 10:51:04,418 INFO L79 Accepts]: Start accepts. Automaton has 831 states and 1099 transitions. Word has length 68 [2025-04-29 10:51:04,418 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:04,418 INFO L485 AbstractCegarLoop]: Abstraction has 831 states and 1099 transitions. [2025-04-29 10:51:04,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:04,418 INFO L278 IsEmpty]: Start isEmpty. Operand 831 states and 1099 transitions. [2025-04-29 10:51:04,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 10:51:04,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:04,419 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] [2025-04-29 10:51:04,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 10:51:04,620 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 [2025-04-29 10:51:04,620 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:04,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1413254295, now seen corresponding path program 1 times [2025-04-29 10:51:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:04,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990133547] [2025-04-29 10:51:04,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:04,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:04,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:04,622 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:51:04,623 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:51:04,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-29 10:51:04,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 10:51:04,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:04,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:04,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 10:51:04,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:04,731 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:51:04,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-29 10:51:04,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:04,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990133547] [2025-04-29 10:51:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990133547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:04,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:51:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-04-29 10:51:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422603693] [2025-04-29 10:51:04,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:04,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 10:51:04,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:04,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 10:51:04,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:51:04,815 INFO L87 Difference]: Start difference. First operand 831 states and 1099 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:05,017 INFO L93 Difference]: Finished difference Result 1225 states and 1572 transitions. [2025-04-29 10:51:05,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:51:05,018 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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 69 [2025-04-29 10:51:05,018 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:05,020 INFO L225 Difference]: With dead ends: 1225 [2025-04-29 10:51:05,020 INFO L226 Difference]: Without dead ends: 1067 [2025-04-29 10:51:05,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-04-29 10:51:05,021 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 180 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:05,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 233 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:51:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-04-29 10:51:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 831. [2025-04-29 10:51:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.3228915662650602) internal successors, (1098), 830 states have internal predecessors, (1098), 0 states have call successors, (0), 0 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:05,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1098 transitions. [2025-04-29 10:51:05,051 INFO L79 Accepts]: Start accepts. Automaton has 831 states and 1098 transitions. Word has length 69 [2025-04-29 10:51:05,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:05,051 INFO L485 AbstractCegarLoop]: Abstraction has 831 states and 1098 transitions. [2025-04-29 10:51:05,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:05,051 INFO L278 IsEmpty]: Start isEmpty. Operand 831 states and 1098 transitions. [2025-04-29 10:51:05,052 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 10:51:05,052 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:05,052 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2025-04-29 10:51:05,059 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:51:05,253 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 [2025-04-29 10:51:05,253 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:05,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash -753722773, now seen corresponding path program 2 times [2025-04-29 10:51:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:05,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801156738] [2025-04-29 10:51:05,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:51:05,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:05,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:05,256 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:51:05,258 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:51:05,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-04-29 10:51:05,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 10:51:05,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:51:05,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:05,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 10:51:05,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:51:05,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:51:05,473 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:05,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801156738] [2025-04-29 10:51:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801156738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:05,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:51:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2025-04-29 10:51:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233536116] [2025-04-29 10:51:05,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:05,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 10:51:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:05,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 10:51:05,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-29 10:51:05,474 INFO L87 Difference]: Start difference. First operand 831 states and 1098 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:05,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:05,661 INFO L93 Difference]: Finished difference Result 1805 states and 2323 transitions. [2025-04-29 10:51:05,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:51:05,661 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 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 69 [2025-04-29 10:51:05,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:05,664 INFO L225 Difference]: With dead ends: 1805 [2025-04-29 10:51:05,664 INFO L226 Difference]: Without dead ends: 1002 [2025-04-29 10:51:05,665 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2025-04-29 10:51:05,665 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 162 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:05,665 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 267 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:51:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-04-29 10:51:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 689. [2025-04-29 10:51:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.2906976744186047) internal successors, (888), 688 states have internal predecessors, (888), 0 states have call successors, (0), 0 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:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 888 transitions. [2025-04-29 10:51:05,697 INFO L79 Accepts]: Start accepts. Automaton has 689 states and 888 transitions. Word has length 69 [2025-04-29 10:51:05,698 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:05,698 INFO L485 AbstractCegarLoop]: Abstraction has 689 states and 888 transitions. [2025-04-29 10:51:05,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:05,698 INFO L278 IsEmpty]: Start isEmpty. Operand 689 states and 888 transitions. [2025-04-29 10:51:05,699 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-29 10:51:05,699 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:05,699 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] [2025-04-29 10:51:05,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 10:51:05,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:05,903 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:05,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash -887736279, now seen corresponding path program 3 times [2025-04-29 10:51:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:05,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053447566] [2025-04-29 10:51:05,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:51:05,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:05,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:05,906 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:51:05,907 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:51:05,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 5 equivalence classes. [2025-04-29 10:51:05,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 69 of 69 statements. [2025-04-29 10:51:05,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-29 10:51:05,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:05,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 10:51:05,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:07,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:09,526 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:09,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053447566] [2025-04-29 10:51:09,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053447566] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:09,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:51:09,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2025-04-29 10:51:09,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045779177] [2025-04-29 10:51:09,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:09,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-29 10:51:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:09,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-29 10:51:09,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 10:51:09,529 INFO L87 Difference]: Start difference. First operand 689 states and 888 transitions. Second operand has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 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:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:51:17,429 INFO L93 Difference]: Finished difference Result 1228 states and 1541 transitions. [2025-04-29 10:51:17,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-29 10:51:17,429 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 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 69 [2025-04-29 10:51:17,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:51:17,432 INFO L225 Difference]: With dead ends: 1228 [2025-04-29 10:51:17,432 INFO L226 Difference]: Without dead ends: 1115 [2025-04-29 10:51:17,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2212 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1937, Invalid=10495, Unknown=0, NotChecked=0, Total=12432 [2025-04-29 10:51:17,437 INFO L437 NwaCegarLoop]: 260 mSDtfsCounter, 1358 mSDsluCounter, 5498 mSDsCounter, 0 mSdLazyCounter, 3578 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 5758 SdHoareTripleChecker+Invalid, 3659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 3578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:51:17,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 5758 Invalid, 3659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 3578 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-29 10:51:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-04-29 10:51:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 837. [2025-04-29 10:51:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2751196172248804) internal successors, (1066), 836 states have internal predecessors, (1066), 0 states have call successors, (0), 0 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:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1066 transitions. [2025-04-29 10:51:17,471 INFO L79 Accepts]: Start accepts. Automaton has 837 states and 1066 transitions. Word has length 69 [2025-04-29 10:51:17,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:51:17,471 INFO L485 AbstractCegarLoop]: Abstraction has 837 states and 1066 transitions. [2025-04-29 10:51:17,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.022222222222222) internal successors, (136), 45 states have internal predecessors, (136), 0 states have call successors, (0), 0 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:17,472 INFO L278 IsEmpty]: Start isEmpty. Operand 837 states and 1066 transitions. [2025-04-29 10:51:17,472 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-04-29 10:51:17,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:51:17,473 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] [2025-04-29 10:51:17,482 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:51:17,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:17,673 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:51:17,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:51:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1302025497, now seen corresponding path program 1 times [2025-04-29 10:51:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 10:51:17,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658874543] [2025-04-29 10:51:17,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:51:17,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:51:17,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:51:17,676 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:51:17,677 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:51:17,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 10:51:17,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 10:51:17,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:51:17,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:51:17,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-29 10:51:17,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:51:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:19,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:51:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:51:21,871 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 10:51:21,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658874543] [2025-04-29 10:51:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658874543] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:51:21,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:51:21,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2025-04-29 10:51:21,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528239559] [2025-04-29 10:51:21,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 10:51:21,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-29 10:51:21,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 10:51:21,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-29 10:51:21,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2006, Unknown=0, NotChecked=0, Total=2162 [2025-04-29 10:51:21,872 INFO L87 Difference]: Start difference. First operand 837 states and 1066 transitions. Second operand has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Killed by 15