./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/eca-rers2012/Problem17_label36.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 e535ec383f9537274a1ea0de6d7103e6fd6013fb76f91148f8797ca645095af2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:13:19,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:13:19,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:13:19,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:13:19,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:13:19,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:13:19,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:13:19,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:13:19,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:13:19,999 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:13:20,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:13:20,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:13:20,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:13:20,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:13:20,001 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:13:20,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:13:20,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:13:20,002 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:13:20,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:13:20,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:13:20,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:13:20,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:13:20,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:13:20,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:13:20,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:20,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:13:20,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:13:20,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:13:20,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:13:20,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:20,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:13:20,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:13:20,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:13:20,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:13:20,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:13:20,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:13:20,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:13:20,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:13:20,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:13:20,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:13:20,007 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 -> e535ec383f9537274a1ea0de6d7103e6fd6013fb76f91148f8797ca645095af2 [2025-01-09 00:13:20,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:13:20,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:13:20,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:13:20,276 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:13:20,277 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:13:20,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label36.c [2025-01-09 00:13:21,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da7c09845/6b08e4cdc40e486981a7d8c9638ae7e5/FLAG22d95f1d1 [2025-01-09 00:13:22,036 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:13:22,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label36.c [2025-01-09 00:13:22,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da7c09845/6b08e4cdc40e486981a7d8c9638ae7e5/FLAG22d95f1d1 [2025-01-09 00:13:22,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da7c09845/6b08e4cdc40e486981a7d8c9638ae7e5 [2025-01-09 00:13:22,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:13:22,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:13:22,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:13:22,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:13:22,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:13:22,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:22" (1/1) ... [2025-01-09 00:13:22,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f14b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:22, skipping insertion in model container [2025-01-09 00:13:22,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:13:22" (1/1) ... [2025-01-09 00:13:22,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:13:22,391 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/eca-rers2012/Problem17_label36.c[8418,8431] [2025-01-09 00:13:22,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:13:22,815 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:13:22,854 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/eca-rers2012/Problem17_label36.c[8418,8431] [2025-01-09 00:13:23,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:13:23,084 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:13:23,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23 WrapperNode [2025-01-09 00:13:23,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:13:23,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:13:23,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:13:23,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:13:23,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,391 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:13:23,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:13:23,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:13:23,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:13:23,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:13:23,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,688 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-01-09 00:13:23,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:13:23,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:13:23,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:13:23,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:13:23,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (1/1) ... [2025-01-09 00:13:23,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:13:23,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:23,978 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-01-09 00:13:23,981 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-01-09 00:13:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:13:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:13:24,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:13:24,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:13:24,107 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:13:24,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:13:27,496 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:13:27,497 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:13:27,526 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:13:27,527 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:13:27,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:27 BoogieIcfgContainer [2025-01-09 00:13:27,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:13:27,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:13:27,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:13:27,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:13:27,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:13:22" (1/3) ... [2025-01-09 00:13:27,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f938b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:27, skipping insertion in model container [2025-01-09 00:13:27,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:13:23" (2/3) ... [2025-01-09 00:13:27,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f938b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:13:27, skipping insertion in model container [2025-01-09 00:13:27,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:13:27" (3/3) ... [2025-01-09 00:13:27,537 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label36.c [2025-01-09 00:13:27,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:13:27,551 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label36.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:13:27,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:13:27,630 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;@48f82f24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:13:27,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:13:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 00:13:27,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:27,645 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] [2025-01-09 00:13:27,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:27,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1361349908, now seen corresponding path program 1 times [2025-01-09 00:13:27,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:27,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453794183] [2025-01-09 00:13:27,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:27,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 00:13:27,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 00:13:27,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:27,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:28,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453794183] [2025-01-09 00:13:28,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453794183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:28,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:28,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914759147] [2025-01-09 00:13:28,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:28,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:28,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:28,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:28,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:28,113 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:30,440 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-01-09 00:13:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 00:13:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:30,455 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 00:13:30,455 INFO L226 Difference]: Without dead ends: 975 [2025-01-09 00:13:30,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:13:30,462 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 433 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:30,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:13:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-01-09 00:13:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-01-09 00:13:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-01-09 00:13:30,537 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 57 [2025-01-09 00:13:30,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:30,538 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-01-09 00:13:30,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-01-09 00:13:30,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 00:13:30,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:30,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:30,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:13:30,542 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:30,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1769154119, now seen corresponding path program 1 times [2025-01-09 00:13:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:30,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989266899] [2025-01-09 00:13:30,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:30,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 00:13:30,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 00:13:30,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:30,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:30,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:30,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989266899] [2025-01-09 00:13:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989266899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:30,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:30,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157084296] [2025-01-09 00:13:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:30,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:30,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:30,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:30,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:30,930 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:33,064 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-01-09 00:13:33,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:33,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-01-09 00:13:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:33,073 INFO L225 Difference]: With dead ends: 2814 [2025-01-09 00:13:33,074 INFO L226 Difference]: Without dead ends: 1844 [2025-01-09 00:13:33,076 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-01-09 00:13:33,076 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 434 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:33,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 920 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:13:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-01-09 00:13:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-01-09 00:13:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-01-09 00:13:33,122 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 127 [2025-01-09 00:13:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:33,123 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-01-09 00:13:33,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-01-09 00:13:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 00:13:33,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:33,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:33,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:13:33,127 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:33,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1032342684, now seen corresponding path program 1 times [2025-01-09 00:13:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:33,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944883008] [2025-01-09 00:13:33,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:33,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 00:13:33,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 00:13:33,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:33,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:33,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:33,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944883008] [2025-01-09 00:13:33,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944883008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:33,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682459810] [2025-01-09 00:13:33,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:33,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:33,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:33,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:33,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:33,348 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:35,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:35,531 INFO L93 Difference]: Finished difference Result 5447 states and 7409 transitions. [2025-01-09 00:13:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-01-09 00:13:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:35,547 INFO L225 Difference]: With dead ends: 5447 [2025-01-09 00:13:35,547 INFO L226 Difference]: Without dead ends: 3607 [2025-01-09 00:13:35,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:13:35,554 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 440 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:35,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 273 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:13:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2025-01-09 00:13:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3583. [2025-01-09 00:13:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 3582 states have (on average 1.3358458961474038) internal successors, (4785), 3582 states have internal predecessors, (4785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4785 transitions. [2025-01-09 00:13:35,633 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4785 transitions. Word has length 149 [2025-01-09 00:13:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:35,635 INFO L471 AbstractCegarLoop]: Abstraction has 3583 states and 4785 transitions. [2025-01-09 00:13:35,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4785 transitions. [2025-01-09 00:13:35,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 00:13:35,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:35,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:13:35,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:13:35,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:35,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:35,643 INFO L85 PathProgramCache]: Analyzing trace with hash 273072136, now seen corresponding path program 1 times [2025-01-09 00:13:35,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:35,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529704722] [2025-01-09 00:13:35,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:35,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:35,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 00:13:35,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 00:13:35,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:35,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529704722] [2025-01-09 00:13:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529704722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:36,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44976981] [2025-01-09 00:13:36,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:36,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:36,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:36,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:36,074 INFO L87 Difference]: Start difference. First operand 3583 states and 4785 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:38,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:38,237 INFO L93 Difference]: Finished difference Result 8895 states and 11847 transitions. [2025-01-09 00:13:38,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:38,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-01-09 00:13:38,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:38,255 INFO L225 Difference]: With dead ends: 8895 [2025-01-09 00:13:38,255 INFO L226 Difference]: Without dead ends: 5314 [2025-01-09 00:13:38,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:13:38,262 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 354 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:38,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 538 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:13:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2025-01-09 00:13:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 5292. [2025-01-09 00:13:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5291 states have (on average 1.27990927990928) internal successors, (6772), 5291 states have internal predecessors, (6772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 6772 transitions. [2025-01-09 00:13:38,358 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 6772 transitions. Word has length 162 [2025-01-09 00:13:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:38,358 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 6772 transitions. [2025-01-09 00:13:38,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 6772 transitions. [2025-01-09 00:13:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 00:13:38,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:38,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-09 00:13:38,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:13:38,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1548582327, now seen corresponding path program 1 times [2025-01-09 00:13:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682082894] [2025-01-09 00:13:38,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:38,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 00:13:38,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 00:13:38,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:38,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:38,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:38,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682082894] [2025-01-09 00:13:38,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682082894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:38,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:38,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485383165] [2025-01-09 00:13:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:38,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:38,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:38,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:38,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:38,551 INFO L87 Difference]: Start difference. First operand 5292 states and 6772 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:40,108 INFO L93 Difference]: Finished difference Result 12705 states and 16559 transitions. [2025-01-09 00:13:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:40,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2025-01-09 00:13:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:40,122 INFO L225 Difference]: With dead ends: 12705 [2025-01-09 00:13:40,123 INFO L226 Difference]: Without dead ends: 5711 [2025-01-09 00:13:40,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-01-09 00:13:40,132 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:40,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2025-01-09 00:13:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4427. [2025-01-09 00:13:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 4426 states have (on average 1.208992318120199) internal successors, (5351), 4426 states have internal predecessors, (5351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 5351 transitions. [2025-01-09 00:13:40,210 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 5351 transitions. Word has length 168 [2025-01-09 00:13:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:40,211 INFO L471 AbstractCegarLoop]: Abstraction has 4427 states and 5351 transitions. [2025-01-09 00:13:40,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 2 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 5351 transitions. [2025-01-09 00:13:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 00:13:40,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:40,214 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:13:40,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:40,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -596275151, now seen corresponding path program 1 times [2025-01-09 00:13:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680452885] [2025-01-09 00:13:40,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:40,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 00:13:40,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 00:13:40,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:40,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:40,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680452885] [2025-01-09 00:13:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680452885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:40,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089887096] [2025-01-09 00:13:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:40,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:40,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:40,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:40,439 INFO L87 Difference]: Start difference. First operand 4427 states and 5351 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:42,150 INFO L93 Difference]: Finished difference Result 11399 states and 13997 transitions. [2025-01-09 00:13:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:42,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-01-09 00:13:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:42,164 INFO L225 Difference]: With dead ends: 11399 [2025-01-09 00:13:42,164 INFO L226 Difference]: Without dead ends: 6974 [2025-01-09 00:13:42,167 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-01-09 00:13:42,168 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:42,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:13:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2025-01-09 00:13:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6974. [2025-01-09 00:13:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6974 states, 6973 states have (on average 1.1834217696830633) internal successors, (8252), 6973 states have internal predecessors, (8252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8252 transitions. [2025-01-09 00:13:42,266 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8252 transitions. Word has length 209 [2025-01-09 00:13:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:42,267 INFO L471 AbstractCegarLoop]: Abstraction has 6974 states and 8252 transitions. [2025-01-09 00:13:42,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8252 transitions. [2025-01-09 00:13:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 00:13:42,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:42,271 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:42,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:13:42,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1601863350, now seen corresponding path program 1 times [2025-01-09 00:13:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:42,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54701270] [2025-01-09 00:13:42,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:42,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 00:13:42,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 00:13:42,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:42,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:13:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54701270] [2025-01-09 00:13:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54701270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:42,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:42,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927598038] [2025-01-09 00:13:42,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:42,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:42,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:42,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:42,412 INFO L87 Difference]: Start difference. First operand 6974 states and 8252 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:43,947 INFO L93 Difference]: Finished difference Result 16914 states and 20159 transitions. [2025-01-09 00:13:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:43,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-01-09 00:13:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:43,973 INFO L225 Difference]: With dead ends: 16914 [2025-01-09 00:13:43,973 INFO L226 Difference]: Without dead ends: 9941 [2025-01-09 00:13:43,979 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-01-09 00:13:43,980 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 394 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:43,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:43,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9941 states. [2025-01-09 00:13:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9941 to 7373. [2025-01-09 00:13:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7372 states have (on average 1.1795984807379274) internal successors, (8696), 7372 states have internal predecessors, (8696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 8696 transitions. [2025-01-09 00:13:44,101 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 8696 transitions. Word has length 211 [2025-01-09 00:13:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:44,102 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 8696 transitions. [2025-01-09 00:13:44,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 8696 transitions. [2025-01-09 00:13:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-09 00:13:44,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:44,107 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:13:44,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:13:44,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:44,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:44,108 INFO L85 PathProgramCache]: Analyzing trace with hash -625636016, now seen corresponding path program 1 times [2025-01-09 00:13:44,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332968531] [2025-01-09 00:13:44,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:44,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:44,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-09 00:13:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-09 00:13:44,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:44,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:13:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332968531] [2025-01-09 00:13:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332968531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375788923] [2025-01-09 00:13:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:44,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:44,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:44,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:44,378 INFO L87 Difference]: Start difference. First operand 7373 states and 8696 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:45,976 INFO L93 Difference]: Finished difference Result 16027 states and 18850 transitions. [2025-01-09 00:13:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:45,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2025-01-09 00:13:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:45,988 INFO L225 Difference]: With dead ends: 16027 [2025-01-09 00:13:45,988 INFO L226 Difference]: Without dead ends: 8656 [2025-01-09 00:13:45,993 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-01-09 00:13:45,993 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 379 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:45,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 894 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8656 states. [2025-01-09 00:13:46,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8656 to 8225. [2025-01-09 00:13:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8225 states, 8224 states have (on average 1.1723005836575875) internal successors, (9641), 8224 states have internal predecessors, (9641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8225 states to 8225 states and 9641 transitions. [2025-01-09 00:13:46,069 INFO L78 Accepts]: Start accepts. Automaton has 8225 states and 9641 transitions. Word has length 277 [2025-01-09 00:13:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:46,070 INFO L471 AbstractCegarLoop]: Abstraction has 8225 states and 9641 transitions. [2025-01-09 00:13:46,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:46,071 INFO L276 IsEmpty]: Start isEmpty. Operand 8225 states and 9641 transitions. [2025-01-09 00:13:46,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-01-09 00:13:46,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:46,075 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:46,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:13:46,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:46,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash -692452172, now seen corresponding path program 1 times [2025-01-09 00:13:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845563253] [2025-01-09 00:13:46,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:46,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-09 00:13:46,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-09 00:13:46,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:46,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 00:13:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845563253] [2025-01-09 00:13:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845563253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171431711] [2025-01-09 00:13:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:46,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:46,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:46,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:46,288 INFO L87 Difference]: Start difference. First operand 8225 states and 9641 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:48,016 INFO L93 Difference]: Finished difference Result 19849 states and 23600 transitions. [2025-01-09 00:13:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:48,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2025-01-09 00:13:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:48,042 INFO L225 Difference]: With dead ends: 19849 [2025-01-09 00:13:48,043 INFO L226 Difference]: Without dead ends: 11201 [2025-01-09 00:13:48,052 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-01-09 00:13:48,056 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:48,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 846 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:13:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11201 states. [2025-01-09 00:13:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11201 to 11201. [2025-01-09 00:13:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11201 states, 11200 states have (on average 1.1403571428571428) internal successors, (12772), 11200 states have internal predecessors, (12772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11201 states to 11201 states and 12772 transitions. [2025-01-09 00:13:48,177 INFO L78 Accepts]: Start accepts. Automaton has 11201 states and 12772 transitions. Word has length 289 [2025-01-09 00:13:48,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:48,178 INFO L471 AbstractCegarLoop]: Abstraction has 11201 states and 12772 transitions. [2025-01-09 00:13:48,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11201 states and 12772 transitions. [2025-01-09 00:13:48,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 00:13:48,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:48,185 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:48,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:13:48,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:48,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2089632369, now seen corresponding path program 1 times [2025-01-09 00:13:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:48,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160868208] [2025-01-09 00:13:48,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:48,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:48,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 00:13:48,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 00:13:48,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:48,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:13:48,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:48,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160868208] [2025-01-09 00:13:48,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160868208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:48,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:48,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:48,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299544453] [2025-01-09 00:13:48,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:48,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:48,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:48,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:48,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:48,393 INFO L87 Difference]: Start difference. First operand 11201 states and 12772 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:49,919 INFO L93 Difference]: Finished difference Result 27079 states and 31152 transitions. [2025-01-09 00:13:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:49,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 329 [2025-01-09 00:13:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:49,954 INFO L225 Difference]: With dead ends: 27079 [2025-01-09 00:13:49,954 INFO L226 Difference]: Without dead ends: 15880 [2025-01-09 00:13:49,966 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-01-09 00:13:49,967 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 442 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:49,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 360 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:13:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15880 states. [2025-01-09 00:13:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15880 to 14600. [2025-01-09 00:13:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14600 states, 14599 states have (on average 1.13713268032057) internal successors, (16601), 14599 states have internal predecessors, (16601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 16601 transitions. [2025-01-09 00:13:50,152 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 16601 transitions. Word has length 329 [2025-01-09 00:13:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:50,152 INFO L471 AbstractCegarLoop]: Abstraction has 14600 states and 16601 transitions. [2025-01-09 00:13:50,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 16601 transitions. [2025-01-09 00:13:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-01-09 00:13:50,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:50,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:13:50,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:13:50,161 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:50,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash 333897220, now seen corresponding path program 1 times [2025-01-09 00:13:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:50,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877559401] [2025-01-09 00:13:50,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:50,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-01-09 00:13:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-01-09 00:13:50,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:50,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:50,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:50,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877559401] [2025-01-09 00:13:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877559401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:50,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:50,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470400651] [2025-01-09 00:13:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:50,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:50,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:50,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:50,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:50,525 INFO L87 Difference]: Start difference. First operand 14600 states and 16601 transitions. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:52,642 INFO L93 Difference]: Finished difference Result 36890 states and 41917 transitions. [2025-01-09 00:13:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:52,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 396 [2025-01-09 00:13:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:52,676 INFO L225 Difference]: With dead ends: 36890 [2025-01-09 00:13:52,676 INFO L226 Difference]: Without dead ends: 21867 [2025-01-09 00:13:52,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:52,692 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 611 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 2792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:52,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 253 Invalid, 2792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:13:52,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21867 states. [2025-01-09 00:13:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21867 to 21864. [2025-01-09 00:13:53,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21864 states, 21863 states have (on average 1.1379042217445) internal successors, (24878), 21863 states have internal predecessors, (24878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21864 states to 21864 states and 24878 transitions. [2025-01-09 00:13:53,193 INFO L78 Accepts]: Start accepts. Automaton has 21864 states and 24878 transitions. Word has length 396 [2025-01-09 00:13:53,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:53,194 INFO L471 AbstractCegarLoop]: Abstraction has 21864 states and 24878 transitions. [2025-01-09 00:13:53,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 21864 states and 24878 transitions. [2025-01-09 00:13:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 00:13:53,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:53,223 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:13:53,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:13:53,224 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:53,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash 448575325, now seen corresponding path program 1 times [2025-01-09 00:13:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:53,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797652308] [2025-01-09 00:13:53,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:53,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 00:13:53,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 00:13:53,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:53,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:53,665 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:13:53,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:53,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797652308] [2025-01-09 00:13:53,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797652308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:53,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:53,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753527090] [2025-01-09 00:13:53,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:53,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:53,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:53,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:53,668 INFO L87 Difference]: Start difference. First operand 21864 states and 24878 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:55,136 INFO L93 Difference]: Finished difference Result 48850 states and 55910 transitions. [2025-01-09 00:13:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:55,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 443 [2025-01-09 00:13:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:55,157 INFO L225 Difference]: With dead ends: 48850 [2025-01-09 00:13:55,157 INFO L226 Difference]: Without dead ends: 26133 [2025-01-09 00:13:55,165 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-01-09 00:13:55,165 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 415 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:55,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 846 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26133 states. [2025-01-09 00:13:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26133 to 26128. [2025-01-09 00:13:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26128 states, 26127 states have (on average 1.1323152294561183) internal successors, (29584), 26127 states have internal predecessors, (29584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26128 states to 26128 states and 29584 transitions. [2025-01-09 00:13:55,432 INFO L78 Accepts]: Start accepts. Automaton has 26128 states and 29584 transitions. Word has length 443 [2025-01-09 00:13:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 26128 states and 29584 transitions. [2025-01-09 00:13:55,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 26128 states and 29584 transitions. [2025-01-09 00:13:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-01-09 00:13:55,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:55,449 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:13:55,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:13:55,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:55,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1564422899, now seen corresponding path program 1 times [2025-01-09 00:13:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:55,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986561116] [2025-01-09 00:13:55,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:55,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-01-09 00:13:55,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-01-09 00:13:55,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:55,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:13:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986561116] [2025-01-09 00:13:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986561116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:56,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169744557] [2025-01-09 00:13:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:56,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:56,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:56,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:56,137 INFO L87 Difference]: Start difference. First operand 26128 states and 29584 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:57,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:57,739 INFO L93 Difference]: Finished difference Result 62936 states and 71153 transitions. [2025-01-09 00:13:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2025-01-09 00:13:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:57,788 INFO L225 Difference]: With dead ends: 62936 [2025-01-09 00:13:57,788 INFO L226 Difference]: Without dead ends: 36810 [2025-01-09 00:13:57,801 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-01-09 00:13:57,801 INFO L435 NwaCegarLoop]: 748 mSDtfsCounter, 442 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:57,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 803 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36810 states. [2025-01-09 00:13:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36810 to 35084. [2025-01-09 00:13:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35084 states, 35083 states have (on average 1.1267565487558076) internal successors, (39530), 35083 states have internal predecessors, (39530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35084 states to 35084 states and 39530 transitions. [2025-01-09 00:13:58,270 INFO L78 Accepts]: Start accepts. Automaton has 35084 states and 39530 transitions. Word has length 492 [2025-01-09 00:13:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:58,271 INFO L471 AbstractCegarLoop]: Abstraction has 35084 states and 39530 transitions. [2025-01-09 00:13:58,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 35084 states and 39530 transitions. [2025-01-09 00:13:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-01-09 00:13:58,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:58,293 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:13:58,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:13:58,294 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:58,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash -119181657, now seen corresponding path program 1 times [2025-01-09 00:13:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:58,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174250723] [2025-01-09 00:13:58,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:58,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-01-09 00:13:58,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-01-09 00:13:58,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:58,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:13:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174250723] [2025-01-09 00:13:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174250723] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:59,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:59,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:13:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154032775] [2025-01-09 00:13:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:59,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:13:59,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:59,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:13:59,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:13:59,461 INFO L87 Difference]: Start difference. First operand 35084 states and 39530 transitions. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:01,650 INFO L93 Difference]: Finished difference Result 88497 states and 99501 transitions. [2025-01-09 00:14:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:14:01,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 500 [2025-01-09 00:14:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:01,704 INFO L225 Difference]: With dead ends: 88497 [2025-01-09 00:14:01,704 INFO L226 Difference]: Without dead ends: 53408 [2025-01-09 00:14:01,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:14:01,722 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 842 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:01,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 181 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:14:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53408 states. [2025-01-09 00:14:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53408 to 53364. [2025-01-09 00:14:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53364 states, 53363 states have (on average 1.117590840095197) internal successors, (59638), 53363 states have internal predecessors, (59638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:02,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53364 states to 53364 states and 59638 transitions. [2025-01-09 00:14:02,370 INFO L78 Accepts]: Start accepts. Automaton has 53364 states and 59638 transitions. Word has length 500 [2025-01-09 00:14:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:02,371 INFO L471 AbstractCegarLoop]: Abstraction has 53364 states and 59638 transitions. [2025-01-09 00:14:02,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 53364 states and 59638 transitions. [2025-01-09 00:14:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2025-01-09 00:14:02,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:02,391 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:14:02,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:14:02,391 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1476926040, now seen corresponding path program 1 times [2025-01-09 00:14:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717160587] [2025-01-09 00:14:02,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:02,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 524 statements into 1 equivalence classes. [2025-01-09 00:14:02,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 524 of 524 statements. [2025-01-09 00:14:02,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:02,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 00:14:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717160587] [2025-01-09 00:14:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717160587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:02,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:02,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349555516] [2025-01-09 00:14:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:02,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:02,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:02,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:02,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:02,923 INFO L87 Difference]: Start difference. First operand 53364 states and 59638 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:04,334 INFO L93 Difference]: Finished difference Result 106290 states and 118777 transitions. [2025-01-09 00:14:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 524 [2025-01-09 00:14:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:04,388 INFO L225 Difference]: With dead ends: 106290 [2025-01-09 00:14:04,388 INFO L226 Difference]: Without dead ends: 52928 [2025-01-09 00:14:04,417 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-01-09 00:14:04,417 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 440 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:04,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 733 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:14:04,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52928 states. [2025-01-09 00:14:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52928 to 52074. [2025-01-09 00:14:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52074 states, 52073 states have (on average 1.0908148176598238) internal successors, (56802), 52073 states have internal predecessors, (56802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:05,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52074 states to 52074 states and 56802 transitions. [2025-01-09 00:14:05,117 INFO L78 Accepts]: Start accepts. Automaton has 52074 states and 56802 transitions. Word has length 524 [2025-01-09 00:14:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:05,118 INFO L471 AbstractCegarLoop]: Abstraction has 52074 states and 56802 transitions. [2025-01-09 00:14:05,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 52074 states and 56802 transitions. [2025-01-09 00:14:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-01-09 00:14:05,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:05,152 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:14:05,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:14:05,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:05,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:05,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1803539195, now seen corresponding path program 1 times [2025-01-09 00:14:05,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:05,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832458351] [2025-01-09 00:14:05,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:05,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:05,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-01-09 00:14:05,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-01-09 00:14:05,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:05,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 377 proven. 82 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-09 00:14:06,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:06,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832458351] [2025-01-09 00:14:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832458351] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584620513] [2025-01-09 00:14:06,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:06,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:14:06,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:06,114 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-01-09 00:14:06,116 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-01-09 00:14:06,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-01-09 00:14:06,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-01-09 00:14:06,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:06,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:06,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:14:06,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:14:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 350 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:07,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:14:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:14:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584620513] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:07,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:14:07,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2025-01-09 00:14:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711489182] [2025-01-09 00:14:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:07,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:14:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:07,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:14:07,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:14:07,713 INFO L87 Difference]: Start difference. First operand 52074 states and 56802 transitions. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:11,079 INFO L93 Difference]: Finished difference Result 143310 states and 156978 transitions. [2025-01-09 00:14:11,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:14:11,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 581 [2025-01-09 00:14:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:11,171 INFO L225 Difference]: With dead ends: 143310 [2025-01-09 00:14:11,171 INFO L226 Difference]: Without dead ends: 87826 [2025-01-09 00:14:11,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1163 GetRequests, 1157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:14:11,209 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 989 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 3160 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 3914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 3160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:11,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 214 Invalid, 3914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 3160 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 00:14:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87826 states. [2025-01-09 00:14:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87826 to 68226. [2025-01-09 00:14:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68226 states, 68225 states have (on average 1.0850128252106999) internal successors, (74025), 68225 states have internal predecessors, (74025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68226 states to 68226 states and 74025 transitions. [2025-01-09 00:14:12,007 INFO L78 Accepts]: Start accepts. Automaton has 68226 states and 74025 transitions. Word has length 581 [2025-01-09 00:14:12,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:12,008 INFO L471 AbstractCegarLoop]: Abstraction has 68226 states and 74025 transitions. [2025-01-09 00:14:12,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 68226 states and 74025 transitions. [2025-01-09 00:14:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-01-09 00:14:12,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:12,021 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:14:12,029 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-01-09 00:14:12,221 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-01-09 00:14:12,222 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:12,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1621027144, now seen corresponding path program 1 times [2025-01-09 00:14:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766854320] [2025-01-09 00:14:12,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:12,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-01-09 00:14:12,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-01-09 00:14:12,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:12,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 00:14:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766854320] [2025-01-09 00:14:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766854320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:12,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889778311] [2025-01-09 00:14:12,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:12,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:12,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:12,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:12,509 INFO L87 Difference]: Start difference. First operand 68226 states and 74025 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:13,980 INFO L93 Difference]: Finished difference Result 141944 states and 153963 transitions. [2025-01-09 00:14:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:13,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 600 [2025-01-09 00:14:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:14,063 INFO L225 Difference]: With dead ends: 141944 [2025-01-09 00:14:14,063 INFO L226 Difference]: Without dead ends: 70742 [2025-01-09 00:14:14,105 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-01-09 00:14:14,106 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 493 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:14,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 618 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:14:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70742 states. [2025-01-09 00:14:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70742 to 65634. [2025-01-09 00:14:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65634 states, 65633 states have (on average 1.0789846571084667) internal successors, (70817), 65633 states have internal predecessors, (70817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65634 states to 65634 states and 70817 transitions. [2025-01-09 00:14:15,159 INFO L78 Accepts]: Start accepts. Automaton has 65634 states and 70817 transitions. Word has length 600 [2025-01-09 00:14:15,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:15,159 INFO L471 AbstractCegarLoop]: Abstraction has 65634 states and 70817 transitions. [2025-01-09 00:14:15,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 65634 states and 70817 transitions. [2025-01-09 00:14:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2025-01-09 00:14:15,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:15,182 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:14:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:14:15,182 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1778957467, now seen corresponding path program 1 times [2025-01-09 00:14:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413866487] [2025-01-09 00:14:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:15,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 718 statements into 1 equivalence classes. [2025-01-09 00:14:15,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 718 of 718 statements. [2025-01-09 00:14:15,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:15,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:14:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413866487] [2025-01-09 00:14:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413866487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:16,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:16,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:14:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254046316] [2025-01-09 00:14:16,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:16,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:14:16,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:16,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:14:16,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:14:16,063 INFO L87 Difference]: Start difference. First operand 65634 states and 70817 transitions. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:17,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:17,966 INFO L93 Difference]: Finished difference Result 143630 states and 154838 transitions. [2025-01-09 00:14:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:14:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 718 [2025-01-09 00:14:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:18,056 INFO L225 Difference]: With dead ends: 143630 [2025-01-09 00:14:18,056 INFO L226 Difference]: Without dead ends: 77993 [2025-01-09 00:14:18,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:14:18,103 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 564 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:18,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 99 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:14:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77993 states. [2025-01-09 00:14:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77993 to 60534. [2025-01-09 00:14:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60534 states, 60533 states have (on average 1.0785521946706755) internal successors, (65288), 60533 states have internal predecessors, (65288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60534 states to 60534 states and 65288 transitions. [2025-01-09 00:14:19,119 INFO L78 Accepts]: Start accepts. Automaton has 60534 states and 65288 transitions. Word has length 718 [2025-01-09 00:14:19,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:19,120 INFO L471 AbstractCegarLoop]: Abstraction has 60534 states and 65288 transitions. [2025-01-09 00:14:19,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 60534 states and 65288 transitions. [2025-01-09 00:14:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-01-09 00:14:19,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:19,144 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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-01-09 00:14:19,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:14:19,144 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:19,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash 584844839, now seen corresponding path program 1 times [2025-01-09 00:14:19,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:19,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123539983] [2025-01-09 00:14:19,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:19,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:19,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-01-09 00:14:19,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-01-09 00:14:19,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:19,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 605 proven. 82 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 00:14:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123539983] [2025-01-09 00:14:19,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123539983] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246197976] [2025-01-09 00:14:19,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:14:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:14:19,861 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-01-09 00:14:19,863 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-01-09 00:14:19,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-01-09 00:14:20,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-01-09 00:14:20,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:20,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:20,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:14:20,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:14:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 605 proven. 82 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 00:14:20,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:14:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 00:14:20,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246197976] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:14:20,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:14:20,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:14:20,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548955336] [2025-01-09 00:14:20,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:20,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:20,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:20,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:14:20,788 INFO L87 Difference]: Start difference. First operand 60534 states and 65288 transitions. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:23,243 INFO L93 Difference]: Finished difference Result 133008 states and 143343 transitions. [2025-01-09 00:14:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:14:23,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 727 [2025-01-09 00:14:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:23,325 INFO L225 Difference]: With dead ends: 133008 [2025-01-09 00:14:23,325 INFO L226 Difference]: Without dead ends: 72476 [2025-01-09 00:14:23,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1455 GetRequests, 1451 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:14:23,365 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 945 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:23,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 79 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:14:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72476 states. [2025-01-09 00:14:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72476 to 66910. [2025-01-09 00:14:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66910 states, 66909 states have (on average 1.0761631469607975) internal successors, (72005), 66909 states have internal predecessors, (72005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66910 states to 66910 states and 72005 transitions. [2025-01-09 00:14:24,252 INFO L78 Accepts]: Start accepts. Automaton has 66910 states and 72005 transitions. Word has length 727 [2025-01-09 00:14:24,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:24,253 INFO L471 AbstractCegarLoop]: Abstraction has 66910 states and 72005 transitions. [2025-01-09 00:14:24,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 66910 states and 72005 transitions. [2025-01-09 00:14:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2025-01-09 00:14:24,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:24,284 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:14:24,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:14:24,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:14:24,485 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:24,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:24,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1369280050, now seen corresponding path program 1 times [2025-01-09 00:14:24,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080777965] [2025-01-09 00:14:24,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:24,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 740 statements into 1 equivalence classes. [2025-01-09 00:14:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 740 of 740 statements. [2025-01-09 00:14:24,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:24,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:14:25,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:25,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080777965] [2025-01-09 00:14:25,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080777965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:25,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:25,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:14:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369606938] [2025-01-09 00:14:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:25,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:14:25,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:25,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:14:25,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:14:25,501 INFO L87 Difference]: Start difference. First operand 66910 states and 72005 transitions. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:27,442 INFO L93 Difference]: Finished difference Result 76290 states and 81891 transitions. [2025-01-09 00:14:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:14:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 740 [2025-01-09 00:14:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:27,525 INFO L225 Difference]: With dead ends: 76290 [2025-01-09 00:14:27,526 INFO L226 Difference]: Without dead ends: 75858 [2025-01-09 00:14:27,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:14:27,546 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 1026 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:27,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 100 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:14:27,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75858 states. [2025-01-09 00:14:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75858 to 67760. [2025-01-09 00:14:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67760 states, 67759 states have (on average 1.076609749258401) internal successors, (72950), 67759 states have internal predecessors, (72950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67760 states to 67760 states and 72950 transitions. [2025-01-09 00:14:28,461 INFO L78 Accepts]: Start accepts. Automaton has 67760 states and 72950 transitions. Word has length 740 [2025-01-09 00:14:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:28,462 INFO L471 AbstractCegarLoop]: Abstraction has 67760 states and 72950 transitions. [2025-01-09 00:14:28,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 67760 states and 72950 transitions. [2025-01-09 00:14:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2025-01-09 00:14:28,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:28,494 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:14:28,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:14:28,494 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:28,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:28,495 INFO L85 PathProgramCache]: Analyzing trace with hash -162947173, now seen corresponding path program 1 times [2025-01-09 00:14:28,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:28,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888456684] [2025-01-09 00:14:28,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:28,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:28,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 785 statements into 1 equivalence classes. [2025-01-09 00:14:28,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 785 of 785 statements. [2025-01-09 00:14:28,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:28,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2025-01-09 00:14:28,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888456684] [2025-01-09 00:14:28,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888456684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:28,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:28,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:28,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870970761] [2025-01-09 00:14:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:28,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:28,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:28,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:28,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:28,920 INFO L87 Difference]: Start difference. First operand 67760 states and 72950 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:30,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:30,354 INFO L93 Difference]: Finished difference Result 142317 states and 153155 transitions. [2025-01-09 00:14:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:30,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 785 [2025-01-09 00:14:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:30,438 INFO L225 Difference]: With dead ends: 142317 [2025-01-09 00:14:30,438 INFO L226 Difference]: Without dead ends: 74559 [2025-01-09 00:14:30,484 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-01-09 00:14:30,485 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 440 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:30,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 314 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:14:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74559 states. [2025-01-09 00:14:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74559 to 72854. [2025-01-09 00:14:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72854 states, 72853 states have (on average 1.0719668373299658) internal successors, (78096), 72853 states have internal predecessors, (78096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72854 states to 72854 states and 78096 transitions. [2025-01-09 00:14:31,327 INFO L78 Accepts]: Start accepts. Automaton has 72854 states and 78096 transitions. Word has length 785 [2025-01-09 00:14:31,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:31,327 INFO L471 AbstractCegarLoop]: Abstraction has 72854 states and 78096 transitions. [2025-01-09 00:14:31,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 72854 states and 78096 transitions. [2025-01-09 00:14:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2025-01-09 00:14:31,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:31,351 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:14:31,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:14:31,351 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:31,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2059372844, now seen corresponding path program 1 times [2025-01-09 00:14:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865979541] [2025-01-09 00:14:31,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:31,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 791 statements into 1 equivalence classes. [2025-01-09 00:14:31,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 791 of 791 statements. [2025-01-09 00:14:31,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:31,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1186 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 912 trivial. 0 not checked. [2025-01-09 00:14:31,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:31,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865979541] [2025-01-09 00:14:31,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865979541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:31,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:31,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:14:31,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473401645] [2025-01-09 00:14:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:31,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:14:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:31,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:14:31,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:14:31,625 INFO L87 Difference]: Start difference. First operand 72854 states and 78096 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:14:32,981 INFO L93 Difference]: Finished difference Result 147406 states and 157953 transitions. [2025-01-09 00:14:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:14:32,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 791 [2025-01-09 00:14:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:14:33,059 INFO L225 Difference]: With dead ends: 147406 [2025-01-09 00:14:33,059 INFO L226 Difference]: Without dead ends: 73279 [2025-01-09 00:14:33,103 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-01-09 00:14:33,105 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 440 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:14:33,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 718 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:14:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73279 states. [2025-01-09 00:14:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73279 to 69021. [2025-01-09 00:14:33,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69021 states, 69020 states have (on average 1.064836279339322) internal successors, (73495), 69020 states have internal predecessors, (73495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69021 states to 69021 states and 73495 transitions. [2025-01-09 00:14:33,931 INFO L78 Accepts]: Start accepts. Automaton has 69021 states and 73495 transitions. Word has length 791 [2025-01-09 00:14:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:14:33,931 INFO L471 AbstractCegarLoop]: Abstraction has 69021 states and 73495 transitions. [2025-01-09 00:14:33,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:14:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 69021 states and 73495 transitions. [2025-01-09 00:14:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2025-01-09 00:14:33,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:14:33,981 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:14:33,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:14:33,981 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:14:33,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:14:33,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1765445569, now seen corresponding path program 1 times [2025-01-09 00:14:33,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:14:33,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737879993] [2025-01-09 00:14:33,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:14:33,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:14:34,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1013 statements into 1 equivalence classes. [2025-01-09 00:14:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1013 of 1013 statements. [2025-01-09 00:14:34,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:14:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:14:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 906 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2025-01-09 00:14:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:14:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737879993] [2025-01-09 00:14:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737879993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:14:34,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:14:34,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:14:34,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810373066] [2025-01-09 00:14:34,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:14:34,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:14:34,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:14:34,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:14:34,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:14:34,945 INFO L87 Difference]: Start difference. First operand 69021 states and 73495 transitions. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)