./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.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/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.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 cf92f342b2da275c63d151f2d4ed52683d7003506826ae2897efde5e3c66195f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:27:02,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:27:02,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:27:02,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:27:02,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:27:02,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:27:02,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:27:02,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:27:02,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:27:02,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:27:02,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:27:02,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:27:02,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:27:02,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:27:02,256 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:27:02,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:27:02,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:27:02,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:27:02,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:27:02,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:27:02,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:02,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:02,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:02,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:02,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:27:02,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:27:02,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:27:02,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:27:02,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:02,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:27:02,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:27:02,259 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 -> cf92f342b2da275c63d151f2d4ed52683d7003506826ae2897efde5e3c66195f [2025-01-09 04:27:02,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:27:02,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:27:02,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:27:02,563 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:27:02,563 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:27:02,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2025-01-09 04:27:03,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65e072e1e/24e9f58fef374c3183ceb7b7875031db/FLAGb7a780a1d [2025-01-09 04:27:04,094 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:27:04,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2025-01-09 04:27:04,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65e072e1e/24e9f58fef374c3183ceb7b7875031db/FLAGb7a780a1d [2025-01-09 04:27:04,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/65e072e1e/24e9f58fef374c3183ceb7b7875031db [2025-01-09 04:27:04,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:27:04,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:27:04,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:04,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:27:04,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:27:04,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179209d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04, skipping insertion in model container [2025-01-09 04:27:04,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:27:04,373 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/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c[14373,14386] [2025-01-09 04:27:04,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:04,386 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:27:04,437 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/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c[14373,14386] [2025-01-09 04:27:04,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:27:04,453 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:27:04,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04 WrapperNode [2025-01-09 04:27:04,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:27:04,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:04,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:27:04,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:27:04,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,508 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 493 [2025-01-09 04:27:04,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:27:04,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:27:04,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:27:04,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:27:04,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,547 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 04:27:04,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:27:04,582 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:27:04,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:27:04,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:27:04,586 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (1/1) ... [2025-01-09 04:27:04,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:27:04,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:27:04,617 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 04:27:04,626 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 04:27:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:27:04,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:27:04,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:27:04,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:27:04,745 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:27:04,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:27:05,269 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-01-09 04:27:05,269 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:27:05,284 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:27:05,284 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:27:05,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:05 BoogieIcfgContainer [2025-01-09 04:27:05,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:27:05,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:27:05,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:27:05,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:27:05,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:27:04" (1/3) ... [2025-01-09 04:27:05,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4495b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:05, skipping insertion in model container [2025-01-09 04:27:05,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:27:04" (2/3) ... [2025-01-09 04:27:05,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4495b3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:27:05, skipping insertion in model container [2025-01-09 04:27:05,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:27:05" (3/3) ... [2025-01-09 04:27:05,296 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2025-01-09 04:27:05,309 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:27:05,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:27:05,362 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:27:05,374 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;@6922d57d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:27:05,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:27:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.78125) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:27:05,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:05,384 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] [2025-01-09 04:27:05,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:05,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2077672603, now seen corresponding path program 1 times [2025-01-09 04:27:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391884454] [2025-01-09 04:27:05,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:05,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:27:05,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:27:05,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:05,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:05,734 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 04:27:05,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391884454] [2025-01-09 04:27:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391884454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:27:05,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128858153] [2025-01-09 04:27:05,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:05,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:27:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:05,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:27:05,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:05,780 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.78125) internal successors, (228), 129 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:05,811 INFO L93 Difference]: Finished difference Result 201 states and 348 transitions. [2025-01-09 04:27:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:27:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 04:27:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:05,822 INFO L225 Difference]: With dead ends: 201 [2025-01-09 04:27:05,822 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 04:27:05,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:27:05,830 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:05,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 04:27:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-09 04:27:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.7698412698412698) internal successors, (223), 126 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 223 transitions. [2025-01-09 04:27:05,875 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 223 transitions. Word has length 37 [2025-01-09 04:27:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:05,875 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 223 transitions. [2025-01-09 04:27:05,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 223 transitions. [2025-01-09 04:27:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:27:05,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:05,878 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] [2025-01-09 04:27:05,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:27:05,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:05,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:05,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1260024153, now seen corresponding path program 1 times [2025-01-09 04:27:05,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:05,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988290908] [2025-01-09 04:27:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:05,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:27:05,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:27:05,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:05,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:06,116 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 04:27:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:06,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988290908] [2025-01-09 04:27:06,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988290908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:06,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:06,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466027056] [2025-01-09 04:27:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:06,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:06,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:06,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:06,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:06,119 INFO L87 Difference]: Start difference. First operand 127 states and 223 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:06,264 INFO L93 Difference]: Finished difference Result 198 states and 342 transitions. [2025-01-09 04:27:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:06,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 04:27:06,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:06,269 INFO L225 Difference]: With dead ends: 198 [2025-01-09 04:27:06,269 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 04:27:06,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:06,270 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:06,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 849 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 04:27:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-09 04:27:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5317460317460319) internal successors, (193), 126 states have internal predecessors, (193), 0 states have call successors, (0), 0 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 04:27:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2025-01-09 04:27:06,278 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 37 [2025-01-09 04:27:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:06,278 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2025-01-09 04:27:06,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2025-01-09 04:27:06,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:27:06,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:06,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:06,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:27:06,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:06,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:06,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1214008033, now seen corresponding path program 1 times [2025-01-09 04:27:06,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:06,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886590398] [2025-01-09 04:27:06,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:06,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:27:06,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:27:06,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:06,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:06,435 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 04:27:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:06,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886590398] [2025-01-09 04:27:06,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886590398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:06,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225449189] [2025-01-09 04:27:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:06,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:06,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:06,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:06,436 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:06,485 INFO L93 Difference]: Finished difference Result 251 states and 405 transitions. [2025-01-09 04:27:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:06,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:27:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:06,487 INFO L225 Difference]: With dead ends: 251 [2025-01-09 04:27:06,487 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 04:27:06,488 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 04:27:06,488 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 89 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:06,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 342 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 04:27:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2025-01-09 04:27:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.569060773480663) internal successors, (284), 181 states have internal predecessors, (284), 0 states have call successors, (0), 0 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 04:27:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 284 transitions. [2025-01-09 04:27:06,495 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 284 transitions. Word has length 66 [2025-01-09 04:27:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:06,496 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 284 transitions. [2025-01-09 04:27:06,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 284 transitions. [2025-01-09 04:27:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:27:06,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:06,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:06,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:27:06,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:06,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1217525517, now seen corresponding path program 1 times [2025-01-09 04:27:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018450529] [2025-01-09 04:27:06,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:06,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:27:06,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:27:06,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:06,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:06,632 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 04:27:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018450529] [2025-01-09 04:27:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018450529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:06,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088108978] [2025-01-09 04:27:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:06,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:06,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:06,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:06,633 INFO L87 Difference]: Start difference. First operand 182 states and 284 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:06,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:06,656 INFO L93 Difference]: Finished difference Result 410 states and 668 transitions. [2025-01-09 04:27:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:27:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:06,658 INFO L225 Difference]: With dead ends: 410 [2025-01-09 04:27:06,658 INFO L226 Difference]: Without dead ends: 288 [2025-01-09 04:27:06,658 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 04:27:06,659 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 91 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:06,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 350 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-01-09 04:27:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2025-01-09 04:27:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 1.6105263157894736) internal successors, (459), 285 states have internal predecessors, (459), 0 states have call successors, (0), 0 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 04:27:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 459 transitions. [2025-01-09 04:27:06,697 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 459 transitions. Word has length 68 [2025-01-09 04:27:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:06,697 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 459 transitions. [2025-01-09 04:27:06,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:06,698 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 459 transitions. [2025-01-09 04:27:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:27:06,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:06,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:06,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:27:06,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:06,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:06,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1694226139, now seen corresponding path program 1 times [2025-01-09 04:27:06,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:06,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851636206] [2025-01-09 04:27:06,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:06,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:06,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:27:06,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:27:06,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:06,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:06,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851636206] [2025-01-09 04:27:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851636206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:06,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:06,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705871614] [2025-01-09 04:27:06,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:06,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:06,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:06,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:06,780 INFO L87 Difference]: Start difference. First operand 286 states and 459 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:06,802 INFO L93 Difference]: Finished difference Result 706 states and 1165 transitions. [2025-01-09 04:27:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:06,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:27:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:06,805 INFO L225 Difference]: With dead ends: 706 [2025-01-09 04:27:06,805 INFO L226 Difference]: Without dead ends: 480 [2025-01-09 04:27:06,806 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 04:27:06,806 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 85 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:06,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 351 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-01-09 04:27:06,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2025-01-09 04:27:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 477 states have (on average 1.6331236897274632) internal successors, (779), 477 states have internal predecessors, (779), 0 states have call successors, (0), 0 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 04:27:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 779 transitions. [2025-01-09 04:27:06,828 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 779 transitions. Word has length 70 [2025-01-09 04:27:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:06,828 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 779 transitions. [2025-01-09 04:27:06,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 779 transitions. [2025-01-09 04:27:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:27:06,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:06,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:06,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:27:06,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:06,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1650914167, now seen corresponding path program 1 times [2025-01-09 04:27:06,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:06,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773880287] [2025-01-09 04:27:06,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:06,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:27:06,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:27:06,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:06,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:06,990 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 04:27:06,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773880287] [2025-01-09 04:27:06,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773880287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:06,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:06,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:06,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378617455] [2025-01-09 04:27:06,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:06,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:06,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:06,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:06,993 INFO L87 Difference]: Start difference. First operand 478 states and 779 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 04:27:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:07,184 INFO L93 Difference]: Finished difference Result 2018 states and 3397 transitions. [2025-01-09 04:27:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:27:07,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-01-09 04:27:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:07,195 INFO L225 Difference]: With dead ends: 2018 [2025-01-09 04:27:07,197 INFO L226 Difference]: Without dead ends: 1600 [2025-01-09 04:27:07,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:27:07,199 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 694 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:07,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1237 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2025-01-09 04:27:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 843. [2025-01-09 04:27:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.652019002375297) internal successors, (1391), 842 states have internal predecessors, (1391), 0 states have call successors, (0), 0 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 04:27:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1391 transitions. [2025-01-09 04:27:07,270 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1391 transitions. Word has length 72 [2025-01-09 04:27:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:07,270 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1391 transitions. [2025-01-09 04:27:07,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 04:27:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1391 transitions. [2025-01-09 04:27:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:27:07,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:07,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:07,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:27:07,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:07,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1561564260, now seen corresponding path program 1 times [2025-01-09 04:27:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:07,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143880462] [2025-01-09 04:27:07,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:07,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:07,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:27:07,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:27:07,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:07,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:07,420 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 04:27:07,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:07,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143880462] [2025-01-09 04:27:07,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143880462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:07,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:07,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:07,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727381905] [2025-01-09 04:27:07,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:07,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:07,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:07,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:07,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:07,423 INFO L87 Difference]: Start difference. First operand 843 states and 1391 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 04:27:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:07,516 INFO L93 Difference]: Finished difference Result 2444 states and 4106 transitions. [2025-01-09 04:27:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:07,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 04:27:07,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:07,523 INFO L225 Difference]: With dead ends: 2444 [2025-01-09 04:27:07,523 INFO L226 Difference]: Without dead ends: 1661 [2025-01-09 04:27:07,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:07,526 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 332 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:07,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 621 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-01-09 04:27:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1243. [2025-01-09 04:27:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 1242 states have (on average 1.6610305958132046) internal successors, (2063), 1242 states have internal predecessors, (2063), 0 states have call successors, (0), 0 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 04:27:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 2063 transitions. [2025-01-09 04:27:07,575 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 2063 transitions. Word has length 73 [2025-01-09 04:27:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:07,575 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 2063 transitions. [2025-01-09 04:27:07,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 04:27:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 2063 transitions. [2025-01-09 04:27:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:27:07,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:07,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:27:07,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:07,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1810393543, now seen corresponding path program 1 times [2025-01-09 04:27:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:07,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406878257] [2025-01-09 04:27:07,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:07,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:27:07,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:27:07,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:07,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:07,690 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 04:27:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:07,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406878257] [2025-01-09 04:27:07,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406878257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:07,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:07,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38285732] [2025-01-09 04:27:07,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:07,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:07,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:07,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:07,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:07,692 INFO L87 Difference]: Start difference. First operand 1243 states and 2063 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:27:07,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:07,783 INFO L93 Difference]: Finished difference Result 2758 states and 4633 transitions. [2025-01-09 04:27:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:27:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:07,801 INFO L225 Difference]: With dead ends: 2758 [2025-01-09 04:27:07,801 INFO L226 Difference]: Without dead ends: 1900 [2025-01-09 04:27:07,811 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 04:27:07,813 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 98 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:07,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 437 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2025-01-09 04:27:07,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1898. [2025-01-09 04:27:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1897 states have (on average 1.6615709014233) internal successors, (3152), 1897 states have internal predecessors, (3152), 0 states have call successors, (0), 0 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 04:27:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 3152 transitions. [2025-01-09 04:27:07,881 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 3152 transitions. Word has length 74 [2025-01-09 04:27:07,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:07,882 INFO L471 AbstractCegarLoop]: Abstraction has 1898 states and 3152 transitions. [2025-01-09 04:27:07,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:27:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 3152 transitions. [2025-01-09 04:27:07,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:27:07,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:07,883 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:07,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:27:07,883 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:07,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1037678375, now seen corresponding path program 1 times [2025-01-09 04:27:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:07,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779804599] [2025-01-09 04:27:07,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:07,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:27:07,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:27:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:08,020 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 04:27:08,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:08,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779804599] [2025-01-09 04:27:08,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779804599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:08,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:08,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:08,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771229460] [2025-01-09 04:27:08,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:08,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:08,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:08,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:08,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:08,023 INFO L87 Difference]: Start difference. First operand 1898 states and 3152 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:27:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:08,074 INFO L93 Difference]: Finished difference Result 3742 states and 6231 transitions. [2025-01-09 04:27:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:08,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:27:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:08,083 INFO L225 Difference]: With dead ends: 3742 [2025-01-09 04:27:08,084 INFO L226 Difference]: Without dead ends: 2684 [2025-01-09 04:27:08,085 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 04:27:08,087 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 92 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:08,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 435 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2025-01-09 04:27:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2682. [2025-01-09 04:27:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 2681 states have (on average 1.6508765386049982) internal successors, (4426), 2681 states have internal predecessors, (4426), 0 states have call successors, (0), 0 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 04:27:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 4426 transitions. [2025-01-09 04:27:08,144 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 4426 transitions. Word has length 74 [2025-01-09 04:27:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:08,144 INFO L471 AbstractCegarLoop]: Abstraction has 2682 states and 4426 transitions. [2025-01-09 04:27:08,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:27:08,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 4426 transitions. [2025-01-09 04:27:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:27:08,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:08,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:08,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:27:08,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:08,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1377287200, now seen corresponding path program 1 times [2025-01-09 04:27:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:08,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038927769] [2025-01-09 04:27:08,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:08,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:27:08,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:27:08,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:08,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:08,222 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 04:27:08,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:08,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038927769] [2025-01-09 04:27:08,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038927769] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:08,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:08,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937075166] [2025-01-09 04:27:08,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:08,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:08,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:08,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:08,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:08,224 INFO L87 Difference]: Start difference. First operand 2682 states and 4426 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:27:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:08,335 INFO L93 Difference]: Finished difference Result 8478 states and 14054 transitions. [2025-01-09 04:27:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:08,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:27:08,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:08,353 INFO L225 Difference]: With dead ends: 8478 [2025-01-09 04:27:08,353 INFO L226 Difference]: Without dead ends: 5866 [2025-01-09 04:27:08,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:08,357 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 330 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:08,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 512 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2025-01-09 04:27:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 4255. [2025-01-09 04:27:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 4254 states have (on average 1.6424541607898449) internal successors, (6987), 4254 states have internal predecessors, (6987), 0 states have call successors, (0), 0 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 04:27:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 6987 transitions. [2025-01-09 04:27:08,456 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 6987 transitions. Word has length 74 [2025-01-09 04:27:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:08,456 INFO L471 AbstractCegarLoop]: Abstraction has 4255 states and 6987 transitions. [2025-01-09 04:27:08,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:27:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 6987 transitions. [2025-01-09 04:27:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:27:08,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:08,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:08,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:27:08,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:08,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:08,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2091420807, now seen corresponding path program 1 times [2025-01-09 04:27:08,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:08,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817663576] [2025-01-09 04:27:08,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:08,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:27:08,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:27:08,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:08,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:08,582 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 04:27:08,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:08,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817663576] [2025-01-09 04:27:08,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817663576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:08,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:08,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:08,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928196761] [2025-01-09 04:27:08,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:08,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:08,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:08,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:08,583 INFO L87 Difference]: Start difference. First operand 4255 states and 6987 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:27:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:08,692 INFO L93 Difference]: Finished difference Result 8507 states and 13972 transitions. [2025-01-09 04:27:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:27:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:08,711 INFO L225 Difference]: With dead ends: 8507 [2025-01-09 04:27:08,712 INFO L226 Difference]: Without dead ends: 6035 [2025-01-09 04:27:08,717 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 04:27:08,718 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 86 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:08,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 424 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2025-01-09 04:27:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 6033. [2025-01-09 04:27:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6033 states, 6032 states have (on average 1.626160477453581) internal successors, (9809), 6032 states have internal predecessors, (9809), 0 states have call successors, (0), 0 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 04:27:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 9809 transitions. [2025-01-09 04:27:08,862 INFO L78 Accepts]: Start accepts. Automaton has 6033 states and 9809 transitions. Word has length 74 [2025-01-09 04:27:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:08,862 INFO L471 AbstractCegarLoop]: Abstraction has 6033 states and 9809 transitions. [2025-01-09 04:27:08,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:27:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6033 states and 9809 transitions. [2025-01-09 04:27:08,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 04:27:08,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:08,863 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:08,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:27:08,864 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:08,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1838593709, now seen corresponding path program 1 times [2025-01-09 04:27:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:08,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322827705] [2025-01-09 04:27:08,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:08,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 04:27:08,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 04:27:08,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:08,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:08,937 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 04:27:08,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322827705] [2025-01-09 04:27:08,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322827705] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:08,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:08,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:08,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100066055] [2025-01-09 04:27:08,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:08,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:08,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:08,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:08,941 INFO L87 Difference]: Start difference. First operand 6033 states and 9809 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 04:27:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:09,204 INFO L93 Difference]: Finished difference Result 19008 states and 30980 transitions. [2025-01-09 04:27:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 04:27:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:09,243 INFO L225 Difference]: With dead ends: 19008 [2025-01-09 04:27:09,243 INFO L226 Difference]: Without dead ends: 13053 [2025-01-09 04:27:09,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:09,252 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 328 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:09,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 617 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13053 states. [2025-01-09 04:27:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13053 to 9500. [2025-01-09 04:27:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9500 states, 9499 states have (on average 1.6144857353405622) internal successors, (15336), 9499 states have internal predecessors, (15336), 0 states have call successors, (0), 0 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 04:27:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9500 states to 9500 states and 15336 transitions. [2025-01-09 04:27:09,526 INFO L78 Accepts]: Start accepts. Automaton has 9500 states and 15336 transitions. Word has length 75 [2025-01-09 04:27:09,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:09,526 INFO L471 AbstractCegarLoop]: Abstraction has 9500 states and 15336 transitions. [2025-01-09 04:27:09,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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 04:27:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 9500 states and 15336 transitions. [2025-01-09 04:27:09,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:27:09,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:09,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:09,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:27:09,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:09,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash 510450379, now seen corresponding path program 1 times [2025-01-09 04:27:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:09,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590607961] [2025-01-09 04:27:09,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:09,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:27:09,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:27:09,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:09,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:09,696 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 04:27:09,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590607961] [2025-01-09 04:27:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590607961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:09,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:09,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230196316] [2025-01-09 04:27:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:09,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:09,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:09,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:09,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:09,698 INFO L87 Difference]: Start difference. First operand 9500 states and 15336 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 04:27:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:09,865 INFO L93 Difference]: Finished difference Result 18924 states and 30569 transitions. [2025-01-09 04:27:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:09,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 04:27:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:09,881 INFO L225 Difference]: With dead ends: 18924 [2025-01-09 04:27:09,882 INFO L226 Difference]: Without dead ends: 9502 [2025-01-09 04:27:09,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:27:09,893 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 171 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:09,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 507 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9502 states. [2025-01-09 04:27:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9502 to 9500. [2025-01-09 04:27:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9500 states, 9499 states have (on average 1.6013264554163595) internal successors, (15211), 9499 states have internal predecessors, (15211), 0 states have call successors, (0), 0 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 04:27:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9500 states to 9500 states and 15211 transitions. [2025-01-09 04:27:10,142 INFO L78 Accepts]: Start accepts. Automaton has 9500 states and 15211 transitions. Word has length 77 [2025-01-09 04:27:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:10,143 INFO L471 AbstractCegarLoop]: Abstraction has 9500 states and 15211 transitions. [2025-01-09 04:27:10,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 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 04:27:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 9500 states and 15211 transitions. [2025-01-09 04:27:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:27:10,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:10,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:10,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:27:10,144 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:10,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash 50997315, now seen corresponding path program 1 times [2025-01-09 04:27:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:10,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184866800] [2025-01-09 04:27:10,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:10,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:27:10,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:27:10,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:10,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:10,296 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 04:27:10,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:10,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184866800] [2025-01-09 04:27:10,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184866800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:10,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:10,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:10,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331838716] [2025-01-09 04:27:10,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:10,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:10,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:10,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:10,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:10,298 INFO L87 Difference]: Start difference. First operand 9500 states and 15211 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:10,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:10,675 INFO L93 Difference]: Finished difference Result 27212 states and 43717 transitions. [2025-01-09 04:27:10,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 04:27:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:10,717 INFO L225 Difference]: With dead ends: 27212 [2025-01-09 04:27:10,717 INFO L226 Difference]: Without dead ends: 17790 [2025-01-09 04:27:10,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:27:10,730 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 167 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:10,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 514 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:10,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17790 states. [2025-01-09 04:27:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17790 to 17788. [2025-01-09 04:27:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17788 states, 17787 states have (on average 1.5865519761623659) internal successors, (28220), 17787 states have internal predecessors, (28220), 0 states have call successors, (0), 0 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 04:27:11,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17788 states to 17788 states and 28220 transitions. [2025-01-09 04:27:11,224 INFO L78 Accepts]: Start accepts. Automaton has 17788 states and 28220 transitions. Word has length 80 [2025-01-09 04:27:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:11,224 INFO L471 AbstractCegarLoop]: Abstraction has 17788 states and 28220 transitions. [2025-01-09 04:27:11,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:27:11,224 INFO L276 IsEmpty]: Start isEmpty. Operand 17788 states and 28220 transitions. [2025-01-09 04:27:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:27:11,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:11,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:27:11,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:27:11,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:11,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1152341108, now seen corresponding path program 1 times [2025-01-09 04:27:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26929691] [2025-01-09 04:27:11,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:11,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:27:11,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:27:11,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:11,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:11,507 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 04:27:11,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26929691] [2025-01-09 04:27:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26929691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:11,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:27:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917016346] [2025-01-09 04:27:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:27:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:11,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:27:11,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:27:11,509 INFO L87 Difference]: Start difference. First operand 17788 states and 28220 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 04:27:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:11,785 INFO L93 Difference]: Finished difference Result 18876 states and 29669 transitions. [2025-01-09 04:27:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:27:11,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-01-09 04:27:11,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:11,824 INFO L225 Difference]: With dead ends: 18876 [2025-01-09 04:27:11,824 INFO L226 Difference]: Without dead ends: 18874 [2025-01-09 04:27:11,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:27:11,831 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:11,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1291 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18874 states. [2025-01-09 04:27:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18874 to 18874. [2025-01-09 04:27:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18874 states, 18873 states have (on average 1.5523234249986753) internal successors, (29297), 18873 states have internal predecessors, (29297), 0 states have call successors, (0), 0 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 04:27:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18874 states to 18874 states and 29297 transitions. [2025-01-09 04:27:12,265 INFO L78 Accepts]: Start accepts. Automaton has 18874 states and 29297 transitions. Word has length 81 [2025-01-09 04:27:12,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:12,266 INFO L471 AbstractCegarLoop]: Abstraction has 18874 states and 29297 transitions. [2025-01-09 04:27:12,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 04:27:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18874 states and 29297 transitions. [2025-01-09 04:27:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 04:27:12,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:12,268 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:12,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:27:12,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1601910541, now seen corresponding path program 1 times [2025-01-09 04:27:12,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:12,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928924296] [2025-01-09 04:27:12,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:12,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:12,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 04:27:12,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 04:27:12,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:12,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:27:12,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:12,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928924296] [2025-01-09 04:27:12,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928924296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:12,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:12,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:12,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240907444] [2025-01-09 04:27:12,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:12,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:12,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:12,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:12,379 INFO L87 Difference]: Start difference. First operand 18874 states and 29297 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 04:27:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:12,766 INFO L93 Difference]: Finished difference Result 46590 states and 72581 transitions. [2025-01-09 04:27:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:12,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 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 107 [2025-01-09 04:27:12,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:12,839 INFO L225 Difference]: With dead ends: 46590 [2025-01-09 04:27:12,840 INFO L226 Difference]: Without dead ends: 37348 [2025-01-09 04:27:12,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:27:12,857 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 412 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:12,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 823 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37348 states. [2025-01-09 04:27:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37348 to 29098. [2025-01-09 04:27:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29098 states, 29097 states have (on average 1.5491975117709729) internal successors, (45077), 29097 states have internal predecessors, (45077), 0 states have call successors, (0), 0 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 04:27:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29098 states to 29098 states and 45077 transitions. [2025-01-09 04:27:13,436 INFO L78 Accepts]: Start accepts. Automaton has 29098 states and 45077 transitions. Word has length 107 [2025-01-09 04:27:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:13,437 INFO L471 AbstractCegarLoop]: Abstraction has 29098 states and 45077 transitions. [2025-01-09 04:27:13,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 04:27:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29098 states and 45077 transitions. [2025-01-09 04:27:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 04:27:13,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:13,440 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:13,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:27:13,440 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:13,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:13,441 INFO L85 PathProgramCache]: Analyzing trace with hash 829195373, now seen corresponding path program 1 times [2025-01-09 04:27:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:13,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089014871] [2025-01-09 04:27:13,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:13,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:13,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 04:27:13,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 04:27:13,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:13,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:27:13,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:13,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089014871] [2025-01-09 04:27:13,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089014871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:13,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:13,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800666404] [2025-01-09 04:27:13,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:13,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:13,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:13,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:13,711 INFO L87 Difference]: Start difference. First operand 29098 states and 45077 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:27:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:14,143 INFO L93 Difference]: Finished difference Result 52282 states and 81451 transitions. [2025-01-09 04:27:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:14,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 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 107 [2025-01-09 04:27:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:14,227 INFO L225 Difference]: With dead ends: 52282 [2025-01-09 04:27:14,227 INFO L226 Difference]: Without dead ends: 43300 [2025-01-09 04:27:14,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:27:14,249 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 411 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:14,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 806 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43300 states. [2025-01-09 04:27:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43300 to 39566. [2025-01-09 04:27:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39566 states, 39565 states have (on average 1.5505876405914318) internal successors, (61349), 39565 states have internal predecessors, (61349), 0 states have call successors, (0), 0 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 04:27:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39566 states to 39566 states and 61349 transitions. [2025-01-09 04:27:15,040 INFO L78 Accepts]: Start accepts. Automaton has 39566 states and 61349 transitions. Word has length 107 [2025-01-09 04:27:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:15,040 INFO L471 AbstractCegarLoop]: Abstraction has 39566 states and 61349 transitions. [2025-01-09 04:27:15,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:27:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 39566 states and 61349 transitions. [2025-01-09 04:27:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 04:27:15,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:15,042 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:15,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:27:15,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:15,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1882937805, now seen corresponding path program 1 times [2025-01-09 04:27:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:15,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859620117] [2025-01-09 04:27:15,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:15,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 04:27:15,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 04:27:15,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:15,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 04:27:15,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:15,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859620117] [2025-01-09 04:27:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859620117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:15,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:15,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:27:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594372542] [2025-01-09 04:27:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:15,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:27:15,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:15,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:27:15,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:27:15,166 INFO L87 Difference]: Start difference. First operand 39566 states and 61349 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 04:27:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:15,647 INFO L93 Difference]: Finished difference Result 55906 states and 87091 transitions. [2025-01-09 04:27:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:27:15,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 107 [2025-01-09 04:27:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:15,721 INFO L225 Difference]: With dead ends: 55906 [2025-01-09 04:27:15,721 INFO L226 Difference]: Without dead ends: 46924 [2025-01-09 04:27:15,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:27:15,745 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 423 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:15,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 824 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2025-01-09 04:27:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 45414. [2025-01-09 04:27:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45414 states, 45413 states have (on average 1.552440931010944) internal successors, (70501), 45413 states have internal predecessors, (70501), 0 states have call successors, (0), 0 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 04:27:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45414 states to 45414 states and 70501 transitions. [2025-01-09 04:27:16,835 INFO L78 Accepts]: Start accepts. Automaton has 45414 states and 70501 transitions. Word has length 107 [2025-01-09 04:27:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:16,836 INFO L471 AbstractCegarLoop]: Abstraction has 45414 states and 70501 transitions. [2025-01-09 04:27:16,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 04:27:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 45414 states and 70501 transitions. [2025-01-09 04:27:16,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:27:16,838 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:16,838 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:16,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:27:16,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:16,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash 491753880, now seen corresponding path program 1 times [2025-01-09 04:27:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973624614] [2025-01-09 04:27:16,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:16,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:16,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:27:16,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:27:16,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:16,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:27:16,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:16,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973624614] [2025-01-09 04:27:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973624614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:16,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:27:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203607788] [2025-01-09 04:27:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:16,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:27:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:16,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:27:16,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:27:16,949 INFO L87 Difference]: Start difference. First operand 45414 states and 70501 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 04:27:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:17,504 INFO L93 Difference]: Finished difference Result 74297 states and 115970 transitions. [2025-01-09 04:27:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:27:17,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 108 [2025-01-09 04:27:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:17,584 INFO L225 Difference]: With dead ends: 74297 [2025-01-09 04:27:17,584 INFO L226 Difference]: Without dead ends: 59103 [2025-01-09 04:27:17,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:27:17,605 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 171 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:17,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 639 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:27:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59103 states. [2025-01-09 04:27:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59103 to 57595. [2025-01-09 04:27:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57595 states, 57594 states have (on average 1.5524360176407264) internal successors, (89411), 57594 states have internal predecessors, (89411), 0 states have call successors, (0), 0 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 04:27:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57595 states to 57595 states and 89411 transitions. [2025-01-09 04:27:18,657 INFO L78 Accepts]: Start accepts. Automaton has 57595 states and 89411 transitions. Word has length 108 [2025-01-09 04:27:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:18,657 INFO L471 AbstractCegarLoop]: Abstraction has 57595 states and 89411 transitions. [2025-01-09 04:27:18,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 04:27:18,657 INFO L276 IsEmpty]: Start isEmpty. Operand 57595 states and 89411 transitions. [2025-01-09 04:27:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 04:27:18,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:18,660 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:18,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:27:18,660 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:18,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash 914455706, now seen corresponding path program 1 times [2025-01-09 04:27:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:18,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721855064] [2025-01-09 04:27:18,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:18,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 04:27:18,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 04:27:18,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:18,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:27:18,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721855064] [2025-01-09 04:27:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721855064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:18,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041987712] [2025-01-09 04:27:18,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:18,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:18,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:18,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:18,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:18,726 INFO L87 Difference]: Start difference. First operand 57595 states and 89411 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 04:27:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:19,976 INFO L93 Difference]: Finished difference Result 124861 states and 194477 transitions. [2025-01-09 04:27:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:19,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 108 [2025-01-09 04:27:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:20,160 INFO L225 Difference]: With dead ends: 124861 [2025-01-09 04:27:20,161 INFO L226 Difference]: Without dead ends: 97591 [2025-01-09 04:27:20,201 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 04:27:20,201 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 74 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:20,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 353 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97591 states. [2025-01-09 04:27:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97591 to 97313. [2025-01-09 04:27:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97313 states, 97312 states have (on average 1.5516277540282801) internal successors, (150992), 97312 states have internal predecessors, (150992), 0 states have call successors, (0), 0 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 04:27:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97313 states to 97313 states and 150992 transitions. [2025-01-09 04:27:22,003 INFO L78 Accepts]: Start accepts. Automaton has 97313 states and 150992 transitions. Word has length 108 [2025-01-09 04:27:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:22,004 INFO L471 AbstractCegarLoop]: Abstraction has 97313 states and 150992 transitions. [2025-01-09 04:27:22,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 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 04:27:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 97313 states and 150992 transitions. [2025-01-09 04:27:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:27:22,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:22,214 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:22,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:27:22,214 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:22,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash 115046573, now seen corresponding path program 1 times [2025-01-09 04:27:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064390171] [2025-01-09 04:27:22,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:22,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:27:22,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:27:22,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:22,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:22,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:22,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064390171] [2025-01-09 04:27:22,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064390171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:22,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:22,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:22,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411193425] [2025-01-09 04:27:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:22,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:22,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:22,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:22,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:22,292 INFO L87 Difference]: Start difference. First operand 97313 states and 150992 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 04:27:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:24,012 INFO L93 Difference]: Finished difference Result 289637 states and 448427 transitions. [2025-01-09 04:27:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:24,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-01-09 04:27:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:24,399 INFO L225 Difference]: With dead ends: 289637 [2025-01-09 04:27:24,399 INFO L226 Difference]: Without dead ends: 192396 [2025-01-09 04:27:24,486 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 04:27:24,487 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 125 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:24,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 434 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192396 states. [2025-01-09 04:27:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192396 to 192394. [2025-01-09 04:27:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192394 states, 192393 states have (on average 1.5349830815050443) internal successors, (295320), 192393 states have internal predecessors, (295320), 0 states have call successors, (0), 0 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 04:27:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192394 states to 192394 states and 295320 transitions. [2025-01-09 04:27:28,318 INFO L78 Accepts]: Start accepts. Automaton has 192394 states and 295320 transitions. Word has length 109 [2025-01-09 04:27:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:28,318 INFO L471 AbstractCegarLoop]: Abstraction has 192394 states and 295320 transitions. [2025-01-09 04:27:28,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 04:27:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 192394 states and 295320 transitions. [2025-01-09 04:27:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:27:28,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:28,331 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:28,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:27:28,331 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:28,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash -816776109, now seen corresponding path program 1 times [2025-01-09 04:27:28,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:28,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904954478] [2025-01-09 04:27:28,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:28,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:28,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:27:28,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:27:28,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:28,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:28,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:28,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904954478] [2025-01-09 04:27:28,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904954478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:28,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:28,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:28,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728795713] [2025-01-09 04:27:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:28,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:28,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:28,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:28,464 INFO L87 Difference]: Start difference. First operand 192394 states and 295320 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 04:27:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:27:32,432 INFO L93 Difference]: Finished difference Result 572619 states and 876937 transitions. [2025-01-09 04:27:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:27:32,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-01-09 04:27:32,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:27:33,300 INFO L225 Difference]: With dead ends: 572619 [2025-01-09 04:27:33,301 INFO L226 Difference]: Without dead ends: 380359 [2025-01-09 04:27:33,476 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 04:27:33,478 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 144 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:27:33,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 461 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:27:33,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380359 states. [2025-01-09 04:27:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380359 to 380357. [2025-01-09 04:27:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380357 states, 380356 states have (on average 1.5179700070460305) internal successors, (577369), 380356 states have internal predecessors, (577369), 0 states have call successors, (0), 0 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 04:27:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380357 states to 380357 states and 577369 transitions. [2025-01-09 04:27:41,633 INFO L78 Accepts]: Start accepts. Automaton has 380357 states and 577369 transitions. Word has length 109 [2025-01-09 04:27:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:27:41,638 INFO L471 AbstractCegarLoop]: Abstraction has 380357 states and 577369 transitions. [2025-01-09 04:27:41,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 04:27:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 380357 states and 577369 transitions. [2025-01-09 04:27:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:27:41,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:27:41,654 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 04:27:41,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:27:41,658 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:27:41,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:27:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash 266031275, now seen corresponding path program 1 times [2025-01-09 04:27:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:27:41,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529682165] [2025-01-09 04:27:41,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:27:41,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:27:41,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:27:41,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:27:41,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:27:41,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:27:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:27:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:27:41,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529682165] [2025-01-09 04:27:41,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529682165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:27:41,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:27:41,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:27:41,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663963357] [2025-01-09 04:27:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:27:41,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:27:41,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:27:41,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:27:41,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:27:41,775 INFO L87 Difference]: Start difference. First operand 380357 states and 577369 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)