./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:06:50,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:06:50,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:06:50,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:06:50,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:06:50,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:06:50,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:06:50,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:06:50,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:06:50,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:06:50,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:06:50,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:06:50,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:06:50,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:06:50,949 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:06:50,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:06:50,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:06:50,949 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:06:50,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:06:50,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:06:50,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:06:50,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:06:50,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:06:50,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:06:50,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:06:50,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:06:50,952 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-jdk21/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 -> 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 [2025-02-05 16:06:51,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:06:51,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:06:51,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:06:51,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:06:51,351 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:06:51,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2025-02-05 16:06:52,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8e26960b/f5e4f91027c54799ae6476df1c818ff6/FLAGe7579382f [2025-02-05 16:06:53,082 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:06:53,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2025-02-05 16:06:53,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8e26960b/f5e4f91027c54799ae6476df1c818ff6/FLAGe7579382f [2025-02-05 16:06:53,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8e26960b/f5e4f91027c54799ae6476df1c818ff6 [2025-02-05 16:06:53,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:06:53,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:06:53,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:06:53,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:06:53,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:06:53,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531eaacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53, skipping insertion in model container [2025-02-05 16:06:53,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:06:53,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[646,659] [2025-02-05 16:06:53,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:06:53,338 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:06:53,344 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c[646,659] [2025-02-05 16:06:53,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:06:53,421 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:06:53,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53 WrapperNode [2025-02-05 16:06:53,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:06:53,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:06:53,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:06:53,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:06:53,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,493 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 813 [2025-02-05 16:06:53,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:06:53,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:06:53,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:06:53,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:06:53,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,542 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:06:53,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:06:53,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:06:53,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:06:53,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:06:53,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (1/1) ... [2025-02-05 16:06:53,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:06:53,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:06:53,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:06:53,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:06:53,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:06:53,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:06:53,617 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 16:06:53,617 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 16:06:53,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:06:53,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:06:53,688 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:06:53,689 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:06:54,354 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-02-05 16:06:54,354 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:06:54,367 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:06:54,367 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:06:54,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:06:54 BoogieIcfgContainer [2025-02-05 16:06:54,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:06:54,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:06:54,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:06:54,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:06:54,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:06:53" (1/3) ... [2025-02-05 16:06:54,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666e29f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:06:54, skipping insertion in model container [2025-02-05 16:06:54,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:06:53" (2/3) ... [2025-02-05 16:06:54,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666e29f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:06:54, skipping insertion in model container [2025-02-05 16:06:54,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:06:54" (3/3) ... [2025-02-05 16:06:54,377 INFO L128 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2025-02-05 16:06:54,387 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:06:54,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.2.cil.c that has 2 procedures, 265 locations, 1 initial locations, 13 loop locations, and 1 error locations. [2025-02-05 16:06:54,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:06:54,452 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d7a9e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:06:54,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:06:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 265 states, 257 states have (on average 1.828793774319066) internal successors, (470), 263 states have internal predecessors, (470), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 16:06:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-05 16:06:54,468 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:54,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:54,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:54,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1555912680, now seen corresponding path program 1 times [2025-02-05 16:06:54,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:54,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554456622] [2025-02-05 16:06:54,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:54,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:54,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-05 16:06:54,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-05 16:06:54,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:54,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554456622] [2025-02-05 16:06:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554456622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566446332] [2025-02-05 16:06:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:54,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:54,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:54,711 INFO L87 Difference]: Start difference. First operand has 265 states, 257 states have (on average 1.828793774319066) internal successors, (470), 263 states have internal predecessors, (470), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:55,014 INFO L93 Difference]: Finished difference Result 694 states and 1254 transitions. [2025-02-05 16:06:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:55,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-05 16:06:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:55,022 INFO L225 Difference]: With dead ends: 694 [2025-02-05 16:06:55,022 INFO L226 Difference]: Without dead ends: 426 [2025-02-05 16:06:55,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:55,026 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 251 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:55,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 756 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:06:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-05 16:06:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 419. [2025-02-05 16:06:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 413 states have (on average 1.6077481840193704) internal successors, (664), 417 states have internal predecessors, (664), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 669 transitions. [2025-02-05 16:06:55,074 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 669 transitions. Word has length 29 [2025-02-05 16:06:55,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:55,074 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 669 transitions. [2025-02-05 16:06:55,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 669 transitions. [2025-02-05 16:06:55,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 16:06:55,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:55,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:55,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:06:55,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1227410258, now seen corresponding path program 1 times [2025-02-05 16:06:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:55,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961829744] [2025-02-05 16:06:55,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:55,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 16:06:55,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 16:06:55,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:55,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:55,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961829744] [2025-02-05 16:06:55,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961829744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:55,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:55,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425384237] [2025-02-05 16:06:55,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:55,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:55,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:55,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:55,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:55,178 INFO L87 Difference]: Start difference. First operand 419 states and 669 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:55,516 INFO L93 Difference]: Finished difference Result 1351 states and 2110 transitions. [2025-02-05 16:06:55,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:06:55,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-05 16:06:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:55,520 INFO L225 Difference]: With dead ends: 1351 [2025-02-05 16:06:55,520 INFO L226 Difference]: Without dead ends: 943 [2025-02-05 16:06:55,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-05 16:06:55,522 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 737 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:55,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 991 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:06:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-02-05 16:06:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 774. [2025-02-05 16:06:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 768 states have (on average 1.5703125) internal successors, (1206), 772 states have internal predecessors, (1206), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1211 transitions. [2025-02-05 16:06:55,555 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1211 transitions. Word has length 40 [2025-02-05 16:06:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:55,555 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1211 transitions. [2025-02-05 16:06:55,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1211 transitions. [2025-02-05 16:06:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 16:06:55,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:55,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:55,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:06:55,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:55,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1352451245, now seen corresponding path program 1 times [2025-02-05 16:06:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334019747] [2025-02-05 16:06:55,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:55,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:55,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 16:06:55,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 16:06:55,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:55,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:55,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:55,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334019747] [2025-02-05 16:06:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334019747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:55,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:55,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707836046] [2025-02-05 16:06:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:55,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:55,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:55,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:55,600 INFO L87 Difference]: Start difference. First operand 774 states and 1211 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:55,696 INFO L93 Difference]: Finished difference Result 2034 states and 3235 transitions. [2025-02-05 16:06:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:55,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-05 16:06:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:55,702 INFO L225 Difference]: With dead ends: 2034 [2025-02-05 16:06:55,705 INFO L226 Difference]: Without dead ends: 1273 [2025-02-05 16:06:55,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:55,707 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 311 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:55,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 980 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2025-02-05 16:06:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1266. [2025-02-05 16:06:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1260 states have (on average 1.6031746031746033) internal successors, (2020), 1264 states have internal predecessors, (2020), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 2025 transitions. [2025-02-05 16:06:55,749 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 2025 transitions. Word has length 40 [2025-02-05 16:06:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:55,749 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 2025 transitions. [2025-02-05 16:06:55,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 2025 transitions. [2025-02-05 16:06:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:06:55,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:55,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:55,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:06:55,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:55,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash -733692317, now seen corresponding path program 1 times [2025-02-05 16:06:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049432295] [2025-02-05 16:06:55,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:55,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:06:55,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:06:55,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:55,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049432295] [2025-02-05 16:06:55,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049432295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:55,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:55,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310206549] [2025-02-05 16:06:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:55,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:55,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:55,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:55,817 INFO L87 Difference]: Start difference. First operand 1266 states and 2025 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:55,865 INFO L93 Difference]: Finished difference Result 3158 states and 5057 transitions. [2025-02-05 16:06:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:55,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 16:06:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:55,873 INFO L225 Difference]: With dead ends: 3158 [2025-02-05 16:06:55,874 INFO L226 Difference]: Without dead ends: 1915 [2025-02-05 16:06:55,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:55,877 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 338 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:55,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 788 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2025-02-05 16:06:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1874. [2025-02-05 16:06:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1868 states have (on average 1.6022483940042827) internal successors, (2993), 1872 states have internal predecessors, (2993), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2998 transitions. [2025-02-05 16:06:55,928 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2998 transitions. Word has length 41 [2025-02-05 16:06:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:55,928 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2998 transitions. [2025-02-05 16:06:55,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2998 transitions. [2025-02-05 16:06:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 16:06:55,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:55,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:55,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:06:55,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:55,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:55,932 INFO L85 PathProgramCache]: Analyzing trace with hash -404784919, now seen corresponding path program 1 times [2025-02-05 16:06:55,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:55,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080285948] [2025-02-05 16:06:55,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:55,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:55,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 16:06:55,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 16:06:55,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:55,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:55,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:55,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080285948] [2025-02-05 16:06:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080285948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:55,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:55,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:06:55,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587968328] [2025-02-05 16:06:55,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:55,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:06:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:55,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:06:55,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:06:55,994 INFO L87 Difference]: Start difference. First operand 1874 states and 2998 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:56,432 INFO L93 Difference]: Finished difference Result 6655 states and 10637 transitions. [2025-02-05 16:06:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:06:56,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-05 16:06:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:56,448 INFO L225 Difference]: With dead ends: 6655 [2025-02-05 16:06:56,449 INFO L226 Difference]: Without dead ends: 4804 [2025-02-05 16:06:56,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-05 16:06:56,453 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 1126 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:56,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1571 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:06:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4804 states. [2025-02-05 16:06:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4804 to 3898. [2025-02-05 16:06:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3898 states, 3892 states have (on average 1.5871017471736897) internal successors, (6177), 3896 states have internal predecessors, (6177), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3898 states to 3898 states and 6182 transitions. [2025-02-05 16:06:56,584 INFO L78 Accepts]: Start accepts. Automaton has 3898 states and 6182 transitions. Word has length 46 [2025-02-05 16:06:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:56,585 INFO L471 AbstractCegarLoop]: Abstraction has 3898 states and 6182 transitions. [2025-02-05 16:06:56,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states and 6182 transitions. [2025-02-05 16:06:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:06:56,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:56,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:56,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:06:56,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:56,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1987091058, now seen corresponding path program 1 times [2025-02-05 16:06:56,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:56,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851291721] [2025-02-05 16:06:56,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:56,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:06:56,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:06:56,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:56,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:56,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:56,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851291721] [2025-02-05 16:06:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851291721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:56,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:56,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648569220] [2025-02-05 16:06:56,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:56,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:56,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:56,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:56,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:56,648 INFO L87 Difference]: Start difference. First operand 3898 states and 6182 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:56,777 INFO L93 Difference]: Finished difference Result 9295 states and 14675 transitions. [2025-02-05 16:06:56,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:56,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-02-05 16:06:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:56,796 INFO L225 Difference]: With dead ends: 9295 [2025-02-05 16:06:56,796 INFO L226 Difference]: Without dead ends: 5420 [2025-02-05 16:06:56,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:56,801 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 358 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:56,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 692 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2025-02-05 16:06:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 5136. [2025-02-05 16:06:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5136 states, 5130 states have (on average 1.562768031189084) internal successors, (8017), 5134 states have internal predecessors, (8017), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5136 states to 5136 states and 8022 transitions. [2025-02-05 16:06:56,995 INFO L78 Accepts]: Start accepts. Automaton has 5136 states and 8022 transitions. Word has length 52 [2025-02-05 16:06:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:56,995 INFO L471 AbstractCegarLoop]: Abstraction has 5136 states and 8022 transitions. [2025-02-05 16:06:56,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 5136 states and 8022 transitions. [2025-02-05 16:06:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:06:56,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:56,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:56,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:06:56,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:56,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 560334390, now seen corresponding path program 1 times [2025-02-05 16:06:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:56,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261080420] [2025-02-05 16:06:56,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:57,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:06:57,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:06:57,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:57,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:57,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:57,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261080420] [2025-02-05 16:06:57,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261080420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:57,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:57,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416670423] [2025-02-05 16:06:57,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:57,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:57,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:57,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:57,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:57,057 INFO L87 Difference]: Start difference. First operand 5136 states and 8022 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:57,361 INFO L93 Difference]: Finished difference Result 12396 states and 19454 transitions. [2025-02-05 16:06:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:57,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-05 16:06:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:57,383 INFO L225 Difference]: With dead ends: 12396 [2025-02-05 16:06:57,383 INFO L226 Difference]: Without dead ends: 7283 [2025-02-05 16:06:57,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:57,390 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 238 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:57,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 851 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:06:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7283 states. [2025-02-05 16:06:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7283 to 5916. [2025-02-05 16:06:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5916 states, 5910 states have (on average 1.5133671742808799) internal successors, (8944), 5914 states have internal predecessors, (8944), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5916 states to 5916 states and 8949 transitions. [2025-02-05 16:06:57,556 INFO L78 Accepts]: Start accepts. Automaton has 5916 states and 8949 transitions. Word has length 59 [2025-02-05 16:06:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 5916 states and 8949 transitions. [2025-02-05 16:06:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5916 states and 8949 transitions. [2025-02-05 16:06:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:06:57,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:57,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:57,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:06:57,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:57,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:57,559 INFO L85 PathProgramCache]: Analyzing trace with hash 385969566, now seen corresponding path program 1 times [2025-02-05 16:06:57,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:57,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271617492] [2025-02-05 16:06:57,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:57,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:06:57,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:06:57,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:57,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:57,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271617492] [2025-02-05 16:06:57,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271617492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:57,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:57,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035923807] [2025-02-05 16:06:57,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:57,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:57,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:57,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:57,623 INFO L87 Difference]: Start difference. First operand 5916 states and 8949 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:57,851 INFO L93 Difference]: Finished difference Result 11675 states and 17675 transitions. [2025-02-05 16:06:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:57,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 16:06:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:57,944 INFO L225 Difference]: With dead ends: 11675 [2025-02-05 16:06:57,944 INFO L226 Difference]: Without dead ends: 5782 [2025-02-05 16:06:57,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:57,962 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 333 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:57,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 431 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5782 states. [2025-02-05 16:06:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5782 to 5782. [2025-02-05 16:06:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 5776 states have (on average 1.4935941828254848) internal successors, (8627), 5780 states have internal predecessors, (8627), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 8632 transitions. [2025-02-05 16:06:58,230 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 8632 transitions. Word has length 61 [2025-02-05 16:06:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:58,230 INFO L471 AbstractCegarLoop]: Abstraction has 5782 states and 8632 transitions. [2025-02-05 16:06:58,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 8632 transitions. [2025-02-05 16:06:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:06:58,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:58,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:58,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:06:58,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:58,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1881621010, now seen corresponding path program 1 times [2025-02-05 16:06:58,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:58,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704868532] [2025-02-05 16:06:58,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:58,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:06:58,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:06:58,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:58,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:58,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:58,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704868532] [2025-02-05 16:06:58,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704868532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:58,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:58,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:58,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105048448] [2025-02-05 16:06:58,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:58,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:58,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:58,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:58,292 INFO L87 Difference]: Start difference. First operand 5782 states and 8632 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:58,445 INFO L93 Difference]: Finished difference Result 11114 states and 16737 transitions. [2025-02-05 16:06:58,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:06:58,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 16:06:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:58,461 INFO L225 Difference]: With dead ends: 11114 [2025-02-05 16:06:58,462 INFO L226 Difference]: Without dead ends: 5355 [2025-02-05 16:06:58,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:58,468 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 145 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:58,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 872 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:06:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5355 states. [2025-02-05 16:06:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5355 to 4698. [2025-02-05 16:06:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4698 states, 4692 states have (on average 1.515771526001705) internal successors, (7112), 4696 states have internal predecessors, (7112), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4698 states to 4698 states and 7117 transitions. [2025-02-05 16:06:58,571 INFO L78 Accepts]: Start accepts. Automaton has 4698 states and 7117 transitions. Word has length 62 [2025-02-05 16:06:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:58,571 INFO L471 AbstractCegarLoop]: Abstraction has 4698 states and 7117 transitions. [2025-02-05 16:06:58,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4698 states and 7117 transitions. [2025-02-05 16:06:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:06:58,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:58,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:06:58,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:06:58,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:58,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash -828985931, now seen corresponding path program 1 times [2025-02-05 16:06:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:58,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940685257] [2025-02-05 16:06:58,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:58,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:06:58,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:06:58,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:58,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:58,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940685257] [2025-02-05 16:06:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940685257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:58,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:58,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:06:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480680699] [2025-02-05 16:06:58,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:58,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:06:58,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:58,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:06:58,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:06:58,643 INFO L87 Difference]: Start difference. First operand 4698 states and 7117 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:59,084 INFO L93 Difference]: Finished difference Result 13631 states and 20684 transitions. [2025-02-05 16:06:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:06:59,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:06:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:59,102 INFO L225 Difference]: With dead ends: 13631 [2025-02-05 16:06:59,102 INFO L226 Difference]: Without dead ends: 9160 [2025-02-05 16:06:59,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:06:59,110 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 910 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:59,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2346 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:06:59,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9160 states. [2025-02-05 16:06:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9160 to 6338. [2025-02-05 16:06:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 6332 states have (on average 1.5192672141503474) internal successors, (9620), 6336 states have internal predecessors, (9620), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 9625 transitions. [2025-02-05 16:06:59,256 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 9625 transitions. Word has length 64 [2025-02-05 16:06:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:59,257 INFO L471 AbstractCegarLoop]: Abstraction has 6338 states and 9625 transitions. [2025-02-05 16:06:59,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 9625 transitions. [2025-02-05 16:06:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:06:59,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:59,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:06:59,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:06:59,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:59,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:59,259 INFO L85 PathProgramCache]: Analyzing trace with hash 365652589, now seen corresponding path program 1 times [2025-02-05 16:06:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256477279] [2025-02-05 16:06:59,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:59,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:59,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:06:59,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:06:59,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:59,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:59,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256477279] [2025-02-05 16:06:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256477279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:59,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:59,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:06:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332205418] [2025-02-05 16:06:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:59,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:06:59,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:59,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:06:59,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:06:59,370 INFO L87 Difference]: Start difference. First operand 6338 states and 9625 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:06:59,601 INFO L93 Difference]: Finished difference Result 15229 states and 22994 transitions. [2025-02-05 16:06:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:06:59,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:06:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:06:59,618 INFO L225 Difference]: With dead ends: 15229 [2025-02-05 16:06:59,618 INFO L226 Difference]: Without dead ends: 9118 [2025-02-05 16:06:59,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:06:59,628 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 806 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:06:59,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 2871 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:06:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9118 states. [2025-02-05 16:06:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9118 to 6694. [2025-02-05 16:06:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6694 states, 6688 states have (on average 1.5095693779904307) internal successors, (10096), 6692 states have internal predecessors, (10096), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6694 states to 6694 states and 10101 transitions. [2025-02-05 16:06:59,830 INFO L78 Accepts]: Start accepts. Automaton has 6694 states and 10101 transitions. Word has length 65 [2025-02-05 16:06:59,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:06:59,830 INFO L471 AbstractCegarLoop]: Abstraction has 6694 states and 10101 transitions. [2025-02-05 16:06:59,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:06:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 6694 states and 10101 transitions. [2025-02-05 16:06:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 16:06:59,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:06:59,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:06:59,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:06:59,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:06:59,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:06:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2008815157, now seen corresponding path program 1 times [2025-02-05 16:06:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:06:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210275604] [2025-02-05 16:06:59,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:06:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:06:59,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 16:06:59,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 16:06:59,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:06:59,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:06:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:06:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:06:59,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210275604] [2025-02-05 16:06:59,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210275604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:06:59,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:06:59,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:06:59,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263214973] [2025-02-05 16:06:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:06:59,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:06:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:06:59,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:06:59,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:06:59,866 INFO L87 Difference]: Start difference. First operand 6694 states and 10101 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:00,069 INFO L93 Difference]: Finished difference Result 14245 states and 21418 transitions. [2025-02-05 16:07:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-05 16:07:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:00,084 INFO L225 Difference]: With dead ends: 14245 [2025-02-05 16:07:00,084 INFO L226 Difference]: Without dead ends: 7572 [2025-02-05 16:07:00,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:07:00,093 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 130 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:00,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 794 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:07:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7572 states. [2025-02-05 16:07:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7572 to 7438. [2025-02-05 16:07:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 7432 states have (on average 1.5021528525296017) internal successors, (11164), 7436 states have internal predecessors, (11164), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 11169 transitions. [2025-02-05 16:07:00,265 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 11169 transitions. Word has length 78 [2025-02-05 16:07:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:00,265 INFO L471 AbstractCegarLoop]: Abstraction has 7438 states and 11169 transitions. [2025-02-05 16:07:00,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 11169 transitions. [2025-02-05 16:07:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:07:00,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:00,267 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:00,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:07:00,268 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:00,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2121964789, now seen corresponding path program 1 times [2025-02-05 16:07:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:00,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901865801] [2025-02-05 16:07:00,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:00,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:00,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:07:00,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:07:00,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:00,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:00,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:00,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901865801] [2025-02-05 16:07:00,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901865801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:00,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:00,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:07:00,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071495713] [2025-02-05 16:07:00,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:00,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:07:00,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:00,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:07:00,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:07:00,323 INFO L87 Difference]: Start difference. First operand 7438 states and 11169 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:00,755 INFO L93 Difference]: Finished difference Result 19214 states and 28609 transitions. [2025-02-05 16:07:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:07:00,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-02-05 16:07:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:00,777 INFO L225 Difference]: With dead ends: 19214 [2025-02-05 16:07:00,777 INFO L226 Difference]: Without dead ends: 11660 [2025-02-05 16:07:00,784 INFO L434 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-02-05 16:07:00,784 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 627 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:00,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1370 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11660 states. [2025-02-05 16:07:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11660 to 10303. [2025-02-05 16:07:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10303 states, 10297 states have (on average 1.4692628921044966) internal successors, (15129), 10301 states have internal predecessors, (15129), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10303 states to 10303 states and 15134 transitions. [2025-02-05 16:07:00,978 INFO L78 Accepts]: Start accepts. Automaton has 10303 states and 15134 transitions. Word has length 91 [2025-02-05 16:07:00,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:00,979 INFO L471 AbstractCegarLoop]: Abstraction has 10303 states and 15134 transitions. [2025-02-05 16:07:00,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 10303 states and 15134 transitions. [2025-02-05 16:07:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:07:00,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:00,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:00,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:07:00,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:00,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1880274421, now seen corresponding path program 1 times [2025-02-05 16:07:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:00,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916324018] [2025-02-05 16:07:00,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:00,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:00,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:07:00,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:07:00,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:00,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:01,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916324018] [2025-02-05 16:07:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916324018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:07:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789076039] [2025-02-05 16:07:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:01,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:01,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:01,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:07:01,054 INFO L87 Difference]: Start difference. First operand 10303 states and 15134 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:01,171 INFO L93 Difference]: Finished difference Result 14648 states and 21582 transitions. [2025-02-05 16:07:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:01,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 16:07:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:01,181 INFO L225 Difference]: With dead ends: 14648 [2025-02-05 16:07:01,181 INFO L226 Difference]: Without dead ends: 4352 [2025-02-05 16:07:01,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:07:01,192 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 329 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:01,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 507 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2025-02-05 16:07:01,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 4292. [2025-02-05 16:07:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4292 states, 4286 states have (on average 1.3777414839010733) internal successors, (5905), 4290 states have internal predecessors, (5905), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 5910 transitions. [2025-02-05 16:07:01,277 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 5910 transitions. Word has length 98 [2025-02-05 16:07:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:01,277 INFO L471 AbstractCegarLoop]: Abstraction has 4292 states and 5910 transitions. [2025-02-05 16:07:01,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:01,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 5910 transitions. [2025-02-05 16:07:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:07:01,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:01,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:01,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:07:01,279 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:01,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1881247399, now seen corresponding path program 1 times [2025-02-05 16:07:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:01,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065733948] [2025-02-05 16:07:01,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:01,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:01,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:07:01,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:07:01,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:01,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:01,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065733948] [2025-02-05 16:07:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065733948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:01,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:07:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210488608] [2025-02-05 16:07:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:01,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:07:01,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:01,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:07:01,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:07:01,335 INFO L87 Difference]: Start difference. First operand 4292 states and 5910 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:01,550 INFO L93 Difference]: Finished difference Result 10097 states and 13893 transitions. [2025-02-05 16:07:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:07:01,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-02-05 16:07:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:01,563 INFO L225 Difference]: With dead ends: 10097 [2025-02-05 16:07:01,563 INFO L226 Difference]: Without dead ends: 5986 [2025-02-05 16:07:01,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:07:01,568 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 525 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:01,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2302 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:01,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2025-02-05 16:07:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 4294. [2025-02-05 16:07:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 4288 states have (on average 1.374766791044776) internal successors, (5895), 4292 states have internal predecessors, (5895), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 5900 transitions. [2025-02-05 16:07:01,714 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 5900 transitions. Word has length 101 [2025-02-05 16:07:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:01,714 INFO L471 AbstractCegarLoop]: Abstraction has 4294 states and 5900 transitions. [2025-02-05 16:07:01,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 5900 transitions. [2025-02-05 16:07:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:07:01,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:01,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:01,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:07:01,716 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:01,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:01,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1087258186, now seen corresponding path program 1 times [2025-02-05 16:07:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:01,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798373574] [2025-02-05 16:07:01,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:07:01,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:07:01,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:01,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:01,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:01,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798373574] [2025-02-05 16:07:01,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798373574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:01,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850063486] [2025-02-05 16:07:01,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:01,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:01,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:01,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:01,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:07:01,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:07:01,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:07:01,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:01,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:01,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:01,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:01,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:01,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:01,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850063486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:01,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:01,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 16:07:01,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502141152] [2025-02-05 16:07:01,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:01,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:01,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:01,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:01,972 INFO L87 Difference]: Start difference. First operand 4294 states and 5900 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:02,122 INFO L93 Difference]: Finished difference Result 5496 states and 7540 transitions. [2025-02-05 16:07:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 16:07:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:02,133 INFO L225 Difference]: With dead ends: 5496 [2025-02-05 16:07:02,133 INFO L226 Difference]: Without dead ends: 5492 [2025-02-05 16:07:02,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:02,136 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 223 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:02,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 783 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:02,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5492 states. [2025-02-05 16:07:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5492 to 5342. [2025-02-05 16:07:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5342 states, 5336 states have (on average 1.3787481259370316) internal successors, (7357), 5340 states have internal predecessors, (7357), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5342 states to 5342 states and 7362 transitions. [2025-02-05 16:07:02,271 INFO L78 Accepts]: Start accepts. Automaton has 5342 states and 7362 transitions. Word has length 103 [2025-02-05 16:07:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:02,271 INFO L471 AbstractCegarLoop]: Abstraction has 5342 states and 7362 transitions. [2025-02-05 16:07:02,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5342 states and 7362 transitions. [2025-02-05 16:07:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 16:07:02,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:02,273 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:02,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:07:02,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 16:07:02,477 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:02,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1746124890, now seen corresponding path program 1 times [2025-02-05 16:07:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:02,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903682449] [2025-02-05 16:07:02,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:02,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 16:07:02,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 16:07:02,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:02,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:07:02,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903682449] [2025-02-05 16:07:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903682449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:02,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596156640] [2025-02-05 16:07:02,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:02,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:02,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:02,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:02,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:07:02,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-02-05 16:07:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-02-05 16:07:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:02,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:02,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:02,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:02,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:02,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596156640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:02,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:02,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 16:07:02,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319522146] [2025-02-05 16:07:02,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:02,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:02,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:02,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:02,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:02,722 INFO L87 Difference]: Start difference. First operand 5342 states and 7362 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:02,802 INFO L93 Difference]: Finished difference Result 9427 states and 13077 transitions. [2025-02-05 16:07:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2025-02-05 16:07:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:02,812 INFO L225 Difference]: With dead ends: 9427 [2025-02-05 16:07:02,812 INFO L226 Difference]: Without dead ends: 4100 [2025-02-05 16:07:02,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 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-02-05 16:07:02,818 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 253 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:02,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 411 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2025-02-05 16:07:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 3749. [2025-02-05 16:07:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3749 states, 3743 states have (on average 1.361741918247395) internal successors, (5097), 3747 states have internal predecessors, (5097), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3749 states to 3749 states and 5102 transitions. [2025-02-05 16:07:02,893 INFO L78 Accepts]: Start accepts. Automaton has 3749 states and 5102 transitions. Word has length 155 [2025-02-05 16:07:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:02,893 INFO L471 AbstractCegarLoop]: Abstraction has 3749 states and 5102 transitions. [2025-02-05 16:07:02,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3749 states and 5102 transitions. [2025-02-05 16:07:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 16:07:02,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:02,895 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:02,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:07:03,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 16:07:03,100 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:03,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1590686511, now seen corresponding path program 1 times [2025-02-05 16:07:03,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:03,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824739094] [2025-02-05 16:07:03,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:03,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:03,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 16:07:03,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 16:07:03,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:03,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:03,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824739094] [2025-02-05 16:07:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824739094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112802328] [2025-02-05 16:07:03,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:03,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:03,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:03,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:03,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:07:03,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 16:07:03,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 16:07:03,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:03,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:03,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:03,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:07:03,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:03,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112802328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:03,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:03,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 16:07:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809601422] [2025-02-05 16:07:03,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:03,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:03,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:03,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:03,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:03,370 INFO L87 Difference]: Start difference. First operand 3749 states and 5102 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:03,458 INFO L93 Difference]: Finished difference Result 7322 states and 10013 transitions. [2025-02-05 16:07:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-02-05 16:07:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:03,469 INFO L225 Difference]: With dead ends: 7322 [2025-02-05 16:07:03,469 INFO L226 Difference]: Without dead ends: 3749 [2025-02-05 16:07:03,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:03,473 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 265 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:03,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 383 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2025-02-05 16:07:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3749. [2025-02-05 16:07:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3749 states, 3743 states have (on average 1.3243387656959658) internal successors, (4957), 3747 states have internal predecessors, (4957), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3749 states to 3749 states and 4962 transitions. [2025-02-05 16:07:03,577 INFO L78 Accepts]: Start accepts. Automaton has 3749 states and 4962 transitions. Word has length 158 [2025-02-05 16:07:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:03,577 INFO L471 AbstractCegarLoop]: Abstraction has 3749 states and 4962 transitions. [2025-02-05 16:07:03,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3749 states and 4962 transitions. [2025-02-05 16:07:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 16:07:03,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:03,579 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:03,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:07:03,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:03,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:03,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1489915827, now seen corresponding path program 1 times [2025-02-05 16:07:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:03,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079453750] [2025-02-05 16:07:03,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:03,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:07:03,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:07:03,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:03,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079453750] [2025-02-05 16:07:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079453750] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551254943] [2025-02-05 16:07:03,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:03,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:03,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:03,888 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:03,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:07:03,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 16:07:03,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 16:07:03,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:03,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:03,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:07:03,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:07:04,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:04,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551254943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:04,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:04,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 16:07:04,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581119175] [2025-02-05 16:07:04,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:04,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:04,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:04,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:04,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:04,019 INFO L87 Difference]: Start difference. First operand 3749 states and 4962 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:04,291 INFO L93 Difference]: Finished difference Result 8633 states and 11604 transitions. [2025-02-05 16:07:04,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:04,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2025-02-05 16:07:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:04,303 INFO L225 Difference]: With dead ends: 8633 [2025-02-05 16:07:04,303 INFO L226 Difference]: Without dead ends: 5060 [2025-02-05 16:07:04,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:07:04,308 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 194 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:04,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 635 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5060 states. [2025-02-05 16:07:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5060 to 4724. [2025-02-05 16:07:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4724 states, 4718 states have (on average 1.2899533700720645) internal successors, (6086), 4722 states have internal predecessors, (6086), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 6091 transitions. [2025-02-05 16:07:04,406 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 6091 transitions. Word has length 159 [2025-02-05 16:07:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:04,406 INFO L471 AbstractCegarLoop]: Abstraction has 4724 states and 6091 transitions. [2025-02-05 16:07:04,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 6091 transitions. [2025-02-05 16:07:04,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 16:07:04,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:04,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:04,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:07:04,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:04,608 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:04,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1952351845, now seen corresponding path program 1 times [2025-02-05 16:07:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:04,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437846636] [2025-02-05 16:07:04,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:04,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 16:07:04,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 16:07:04,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:04,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:04,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437846636] [2025-02-05 16:07:04,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437846636] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:04,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860014967] [2025-02-05 16:07:04,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:04,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:04,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:04,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:04,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:07:04,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 16:07:04,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 16:07:04,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:04,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:04,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:07:04,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:05,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:07:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:07:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860014967] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:07:05,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:07:05,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2025-02-05 16:07:05,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710701251] [2025-02-05 16:07:05,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:07:05,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:07:05,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:05,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:07:05,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:07:05,188 INFO L87 Difference]: Start difference. First operand 4724 states and 6091 transitions. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:05,540 INFO L93 Difference]: Finished difference Result 13194 states and 17047 transitions. [2025-02-05 16:07:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:07:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2025-02-05 16:07:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:05,554 INFO L225 Difference]: With dead ends: 13194 [2025-02-05 16:07:05,554 INFO L226 Difference]: Without dead ends: 8646 [2025-02-05 16:07:05,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:07:05,561 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 883 mSDsluCounter, 3679 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 4210 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:05,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 4210 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:07:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2025-02-05 16:07:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 7367. [2025-02-05 16:07:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7367 states, 7361 states have (on average 1.3017253090612688) internal successors, (9582), 7365 states have internal predecessors, (9582), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 9587 transitions. [2025-02-05 16:07:05,717 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 9587 transitions. Word has length 161 [2025-02-05 16:07:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:05,717 INFO L471 AbstractCegarLoop]: Abstraction has 7367 states and 9587 transitions. [2025-02-05 16:07:05,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 9587 transitions. [2025-02-05 16:07:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-05 16:07:05,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:05,720 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:05,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:07:05,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:05,920 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:05,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1926375904, now seen corresponding path program 1 times [2025-02-05 16:07:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736903336] [2025-02-05 16:07:05,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:05,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:05,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 16:07:05,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 16:07:05,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:05,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 99 proven. 102 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:07:06,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:06,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736903336] [2025-02-05 16:07:06,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736903336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:06,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862432372] [2025-02-05 16:07:06,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:06,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:06,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:06,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:06,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:07:06,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-05 16:07:06,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-05 16:07:06,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:06,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:06,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 16:07:06,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:07:06,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:07:06,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862432372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:06,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 16:07:06,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-02-05 16:07:06,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355775048] [2025-02-05 16:07:06,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:06,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:07:06,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:06,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:07:06,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:07:06,484 INFO L87 Difference]: Start difference. First operand 7367 states and 9587 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:06,750 INFO L93 Difference]: Finished difference Result 15356 states and 19938 transitions. [2025-02-05 16:07:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:06,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2025-02-05 16:07:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:06,763 INFO L225 Difference]: With dead ends: 15356 [2025-02-05 16:07:06,763 INFO L226 Difference]: Without dead ends: 8162 [2025-02-05 16:07:06,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:07:06,770 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 967 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:06,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 2199 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:07:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8162 states. [2025-02-05 16:07:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8162 to 7248. [2025-02-05 16:07:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7248 states, 7242 states have (on average 1.3006075669704502) internal successors, (9419), 7246 states have internal predecessors, (9419), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 9424 transitions. [2025-02-05 16:07:06,921 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 9424 transitions. Word has length 259 [2025-02-05 16:07:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:06,922 INFO L471 AbstractCegarLoop]: Abstraction has 7248 states and 9424 transitions. [2025-02-05 16:07:06,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 9424 transitions. [2025-02-05 16:07:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-05 16:07:06,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:06,924 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:06,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:07:07,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-05 16:07:07,125 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:07,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1307371487, now seen corresponding path program 1 times [2025-02-05 16:07:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:07,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020211877] [2025-02-05 16:07:07,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-05 16:07:07,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-05 16:07:07,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:07,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 16:07:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020211877] [2025-02-05 16:07:07,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020211877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:07,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:07,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:07:07,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409827006] [2025-02-05 16:07:07,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:07,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:07:07,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:07,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:07:07,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:07:07,215 INFO L87 Difference]: Start difference. First operand 7248 states and 9424 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:07,354 INFO L93 Difference]: Finished difference Result 8104 states and 10386 transitions. [2025-02-05 16:07:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:07:07,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 260 [2025-02-05 16:07:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:07,360 INFO L225 Difference]: With dead ends: 8104 [2025-02-05 16:07:07,360 INFO L226 Difference]: Without dead ends: 919 [2025-02-05 16:07:07,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:07:07,366 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 128 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:07,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 380 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:07:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2025-02-05 16:07:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 917. [2025-02-05 16:07:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 913 states have (on average 1.0832420591456735) internal successors, (989), 915 states have internal predecessors, (989), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 992 transitions. [2025-02-05 16:07:07,412 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 992 transitions. Word has length 260 [2025-02-05 16:07:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:07,413 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 992 transitions. [2025-02-05 16:07:07,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 992 transitions. [2025-02-05 16:07:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-05 16:07:07,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:07,416 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:07,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:07:07,417 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:07,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash -209780585, now seen corresponding path program 1 times [2025-02-05 16:07:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:07,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215514895] [2025-02-05 16:07:07,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:07,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-05 16:07:07,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-05 16:07:07,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:07,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 16:07:07,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:07,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215514895] [2025-02-05 16:07:07,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215514895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:07,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:07,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:07:07,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861129095] [2025-02-05 16:07:07,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:07,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:07:07,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:07,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:07:07,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:07:07,600 INFO L87 Difference]: Start difference. First operand 917 states and 992 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:07,710 INFO L93 Difference]: Finished difference Result 1224 states and 1323 transitions. [2025-02-05 16:07:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:07:07,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-02-05 16:07:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:07,715 INFO L225 Difference]: With dead ends: 1224 [2025-02-05 16:07:07,715 INFO L226 Difference]: Without dead ends: 925 [2025-02-05 16:07:07,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:07:07,716 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 218 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:07,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1440 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-02-05 16:07:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 915. [2025-02-05 16:07:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 911 states have (on average 1.079034028540066) internal successors, (983), 913 states have internal predecessors, (983), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 986 transitions. [2025-02-05 16:07:07,744 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 986 transitions. Word has length 261 [2025-02-05 16:07:07,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:07,744 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 986 transitions. [2025-02-05 16:07:07,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 7 states have internal predecessors, (167), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 986 transitions. [2025-02-05 16:07:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-05 16:07:07,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:07,746 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:07,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:07:07,746 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:07,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1913818165, now seen corresponding path program 1 times [2025-02-05 16:07:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:07,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622506404] [2025-02-05 16:07:07,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:07,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:07,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-05 16:07:07,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-05 16:07:07,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:07,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 16:07:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622506404] [2025-02-05 16:07:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622506404] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:07:07,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:07:07,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:07:07,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983698993] [2025-02-05 16:07:07,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:07:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:07:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:07,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:07:07,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:07:07,832 INFO L87 Difference]: Start difference. First operand 915 states and 986 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:07,881 INFO L93 Difference]: Finished difference Result 1203 states and 1293 transitions. [2025-02-05 16:07:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:07:07,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 262 [2025-02-05 16:07:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:07,887 INFO L225 Difference]: With dead ends: 1203 [2025-02-05 16:07:07,887 INFO L226 Difference]: Without dead ends: 902 [2025-02-05 16:07:07,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:07:07,888 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 176 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:07,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 835 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:07:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-02-05 16:07:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 898. [2025-02-05 16:07:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 895 states have (on average 1.0625698324022346) internal successors, (951), 896 states have internal predecessors, (951), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 953 transitions. [2025-02-05 16:07:07,911 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 953 transitions. Word has length 262 [2025-02-05 16:07:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:07,912 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 953 transitions. [2025-02-05 16:07:07,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 953 transitions. [2025-02-05 16:07:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-02-05 16:07:07,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:07,915 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:07,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:07:07,915 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:07,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:07,915 INFO L85 PathProgramCache]: Analyzing trace with hash -876921171, now seen corresponding path program 1 times [2025-02-05 16:07:07,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:07,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670797687] [2025-02-05 16:07:07,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:07,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:07,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-02-05 16:07:07,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-02-05 16:07:07,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:07,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 38 proven. 143 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 16:07:08,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:08,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670797687] [2025-02-05 16:07:08,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670797687] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:08,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652036903] [2025-02-05 16:07:08,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:08,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:08,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:08,725 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:08,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:07:08,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-02-05 16:07:08,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-02-05 16:07:08,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:08,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:08,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 16:07:08,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 40 proven. 124 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 16:07:09,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:07:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 15 proven. 149 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-05 16:07:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652036903] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:07:09,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:07:09,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 30 [2025-02-05 16:07:09,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863089224] [2025-02-05 16:07:09,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:07:09,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:07:09,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:09,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:07:09,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:07:09,645 INFO L87 Difference]: Start difference. First operand 898 states and 953 transitions. Second operand has 30 states, 30 states have (on average 13.566666666666666) internal successors, (407), 30 states have internal predecessors, (407), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:10,057 INFO L93 Difference]: Finished difference Result 909 states and 963 transitions. [2025-02-05 16:07:10,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 16:07:10,057 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 13.566666666666666) internal successors, (407), 30 states have internal predecessors, (407), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2025-02-05 16:07:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:10,061 INFO L225 Difference]: With dead ends: 909 [2025-02-05 16:07:10,061 INFO L226 Difference]: Without dead ends: 906 [2025-02-05 16:07:10,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1701, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 16:07:10,062 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 604 mSDsluCounter, 7199 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 7584 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:10,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 7584 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:07:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-02-05 16:07:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 898. [2025-02-05 16:07:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 895 states have (on average 1.0614525139664805) internal successors, (950), 896 states have internal predecessors, (950), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 952 transitions. [2025-02-05 16:07:10,085 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 952 transitions. Word has length 321 [2025-02-05 16:07:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:10,085 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 952 transitions. [2025-02-05 16:07:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 13.566666666666666) internal successors, (407), 30 states have internal predecessors, (407), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 952 transitions. [2025-02-05 16:07:10,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-02-05 16:07:10,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:10,088 INFO L218 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:07:10,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 16:07:10,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:10,291 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:10,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1152527705, now seen corresponding path program 1 times [2025-02-05 16:07:10,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:10,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139126867] [2025-02-05 16:07:10,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:10,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:10,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-02-05 16:07:10,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-02-05 16:07:10,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:10,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 140 proven. 46 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-05 16:07:10,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:10,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139126867] [2025-02-05 16:07:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139126867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066341325] [2025-02-05 16:07:10,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:10,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:10,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:10,519 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:10,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 16:07:10,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-02-05 16:07:10,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-02-05 16:07:10,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:10,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:10,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:07:10,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 140 proven. 46 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-05 16:07:10,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:07:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 140 proven. 46 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-05 16:07:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066341325] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:07:10,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:07:10,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2025-02-05 16:07:10,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344949401] [2025-02-05 16:07:10,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:07:10,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:07:10,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:10,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:07:10,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:07:10,909 INFO L87 Difference]: Start difference. First operand 898 states and 952 transitions. Second operand has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:11,054 INFO L93 Difference]: Finished difference Result 1007 states and 1064 transitions. [2025-02-05 16:07:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 16:07:11,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366 [2025-02-05 16:07:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:11,058 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 16:07:11,058 INFO L226 Difference]: Without dead ends: 903 [2025-02-05 16:07:11,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 735 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:07:11,058 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 422 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:11,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 2317 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:07:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-02-05 16:07:11,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 897. [2025-02-05 16:07:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 895 states have (on average 1.0569832402234638) internal successors, (946), 895 states have internal predecessors, (946), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 947 transitions. [2025-02-05 16:07:11,081 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 947 transitions. Word has length 366 [2025-02-05 16:07:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:11,082 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 947 transitions. [2025-02-05 16:07:11,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.3) internal successors, (273), 10 states have internal predecessors, (273), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 947 transitions. [2025-02-05 16:07:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-02-05 16:07:11,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:07:11,086 INFO L218 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:07:11,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 16:07:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-05 16:07:11,290 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:07:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:07:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1759637311, now seen corresponding path program 1 times [2025-02-05 16:07:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:07:11,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539887150] [2025-02-05 16:07:11,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:07:11,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-05 16:07:11,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-05 16:07:11,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:11,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 90 proven. 339 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:07:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:07:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539887150] [2025-02-05 16:07:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539887150] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:07:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152939463] [2025-02-05 16:07:11,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:07:11,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:11,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:07:11,898 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:07:11,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 16:07:11,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-05 16:07:12,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-05 16:07:12,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:07:12,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:07:12,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-05 16:07:12,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:07:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 92 proven. 337 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:07:12,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:07:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 20 proven. 409 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:07:13,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152939463] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:07:13,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:07:13,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2025-02-05 16:07:13,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038739394] [2025-02-05 16:07:13,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:07:13,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 16:07:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:07:13,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 16:07:13,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 16:07:13,131 INFO L87 Difference]: Start difference. First operand 897 states and 947 transitions. Second operand has 33 states, 33 states have (on average 19.151515151515152) internal successors, (632), 33 states have internal predecessors, (632), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:13,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:07:13,667 INFO L93 Difference]: Finished difference Result 903 states and 953 transitions. [2025-02-05 16:07:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 16:07:13,668 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 19.151515151515152) internal successors, (632), 33 states have internal predecessors, (632), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 427 [2025-02-05 16:07:13,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:07:13,671 INFO L225 Difference]: With dead ends: 903 [2025-02-05 16:07:13,671 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 16:07:13,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 846 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=2512, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 16:07:13,673 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 740 mSDsluCounter, 11096 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 11615 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:07:13,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 11615 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:07:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 16:07:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 16:07:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 16:07:13,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2025-02-05 16:07:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:07:13,676 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 16:07:13,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 19.151515151515152) internal successors, (632), 33 states have internal predecessors, (632), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:07:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 16:07:13,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 16:07:13,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 16:07:13,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 16:07:13,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:07:13,883 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-05 16:07:13,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 16:07:26,851 WARN L286 SmtUtils]: Spent 5.53s on a formula simplification. DAG size of input: 251 DAG size of output: 346 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-05 16:07:52,233 WARN L286 SmtUtils]: Spent 25.34s on a formula simplification. DAG size of input: 199 DAG size of output: 287 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-05 16:07:58,095 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 16:07:58,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 04:07:58 BoogieIcfgContainer [2025-02-05 16:07:58,144 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 16:07:58,144 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 16:07:58,144 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 16:07:58,144 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 16:07:58,145 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:06:54" (3/4) ... [2025-02-05 16:07:58,147 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 16:07:58,152 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure error [2025-02-05 16:07:58,168 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-05 16:07:58,169 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-05 16:07:58,169 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 16:07:58,170 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 16:07:58,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 16:07:58,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 16:07:58,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 16:07:58,307 INFO L158 Benchmark]: Toolchain (without parser) took 65181.91ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 112.5MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 147.3MB. Max. memory is 16.1GB. [2025-02-05 16:07:58,308 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:07:58,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.42ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 92.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 16:07:58,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.37ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 16:07:58,308 INFO L158 Benchmark]: Boogie Preprocessor took 67.80ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 86.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:07:58,308 INFO L158 Benchmark]: IcfgBuilder took 801.76ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 107.3MB in the end (delta: -20.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2025-02-05 16:07:58,309 INFO L158 Benchmark]: TraceAbstraction took 63773.49ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 106.6MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2025-02-05 16:07:58,309 INFO L158 Benchmark]: Witness Printer took 162.21ms. Allocated memory is still 2.2GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 16:07:58,309 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.45ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.42ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 92.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.37ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.80ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 86.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 801.76ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 107.3MB in the end (delta: -20.4MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * TraceAbstraction took 63773.49ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 106.6MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 162.21ms. Allocated memory is still 2.2GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 265 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12237 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12237 mSDsluCounter, 50914 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38397 mSDsCounter, 538 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4661 IncrementalHoareTripleChecker+Invalid, 5199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 538 mSolverCounterUnsat, 12517 mSDtfsCounter, 4661 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3631 GetRequests, 3420 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10303occurred in iteration=13, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 27 MinimizatonAttempts, 14987 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 5928 NumberOfCodeBlocks, 5928 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 7163 ConstructedInterpolants, 0 QuantifiedInterpolants, 19115 SizeOfPredicates, 32 NumberOfNonLiveVariables, 6484 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2375/4268 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 643]: Location Invariant Derived location invariant: ((((((((((((((((2 <= c_write_req_ev) && (0 <= a)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev))) - InvariantResult [Line: 881]: Location Invariant Derived location invariant: ((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 490]: Location Invariant Derived location invariant: (((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) - InvariantResult [Line: 293]: Location Invariant Derived location invariant: ((((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (1 <= a)) && (2 <= c_m_ev))) || (((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_type != 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 1260]: Location Invariant Derived location invariant: ((((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 1124]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 533]: Location Invariant Derived location invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 884]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((s_run_st != 0) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 183]: Location Invariant Derived location invariant: ((((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_st != 0)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 139]: Location Invariant Derived location invariant: (((((((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 150]: Location Invariant Derived location invariant: (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (51 == req_d)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) - InvariantResult [Line: 1006]: Location Invariant Derived location invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 500]: Location Invariant Derived location invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (req_a___0 == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-05 16:07:58,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE