./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.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_lcr-var-start-time.6.1.ufo.BOUNDED-12.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 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:23:38,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:23:38,282 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:23:38,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:23:38,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:23:38,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:23:38,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:23:38,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:23:38,317 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:23:38,317 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:23:38,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:23:38,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:23:38,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:23:38,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:23:38,318 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:23:38,318 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:23:38,318 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:23:38,318 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:23:38,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:23:38,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:23:38,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:23:38,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:23:38,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:23:38,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:23:38,319 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:23:38,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:23:38,320 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:23:38,320 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:23:38,320 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:23:38,320 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:23:38,320 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:23:38,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:23:38,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:38,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:23:38,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:23:38,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:23:38,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:23:38,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:38,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:23:38,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:23:38,322 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 -> 5cbdd74a230613e4bdaea53735767d2cb8a557f2fb27b4c6d6d20587e28e4a0f [2025-01-09 04:23:38,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:23:38,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:23:38,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:23:38,623 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:23:38,623 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:23:38,624 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2025-01-09 04:23:39,928 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2367b703/497d65826f1446a2b6ae953a6c39e4e0/FLAGc8db11801 [2025-01-09 04:23:40,212 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:23:40,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2025-01-09 04:23:40,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2367b703/497d65826f1446a2b6ae953a6c39e4e0/FLAGc8db11801 [2025-01-09 04:23:40,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d2367b703/497d65826f1446a2b6ae953a6c39e4e0 [2025-01-09 04:23:40,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:23:40,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:23:40,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:23:40,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:23:40,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:23:40,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47abc21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40, skipping insertion in model container [2025-01-09 04:23:40,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:23:40,457 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_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c[16977,16990] [2025-01-09 04:23:40,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:23:40,467 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:23:40,520 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_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c[16977,16990] [2025-01-09 04:23:40,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:23:40,538 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:23:40,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40 WrapperNode [2025-01-09 04:23:40,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:23:40,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:23:40,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:23:40,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:23:40,548 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:23:40" (1/1) ... [2025-01-09 04:23:40,561 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:23:40" (1/1) ... [2025-01-09 04:23:40,590 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 453 [2025-01-09 04:23:40,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:23:40,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:23:40,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:23:40,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:23:40,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,615 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:23:40,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:23:40,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:23:40,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:23:40,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:23:40,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (1/1) ... [2025-01-09 04:23:40,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:23:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:40,673 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:23:40,677 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:23:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:23:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:23:40,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:23:40,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:23:40,806 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:23:40,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:23:41,321 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-01-09 04:23:41,321 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:23:41,331 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:23:41,332 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:23:41,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:41 BoogieIcfgContainer [2025-01-09 04:23:41,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:23:41,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:23:41,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:23:41,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:23:41,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:23:40" (1/3) ... [2025-01-09 04:23:41,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4883e748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:41, skipping insertion in model container [2025-01-09 04:23:41,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:23:40" (2/3) ... [2025-01-09 04:23:41,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4883e748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:23:41, skipping insertion in model container [2025-01-09 04:23:41,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:23:41" (3/3) ... [2025-01-09 04:23:41,344 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2025-01-09 04:23:41,357 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:23:41,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c that has 1 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 04:23:41,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:23:41,429 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;@4e53fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:23:41,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:23:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 118 states have (on average 1.7627118644067796) internal successors, (208), 119 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:23:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:23:41,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:41,441 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:23:41,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:41,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1049268275, now seen corresponding path program 1 times [2025-01-09 04:23:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:41,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983264661] [2025-01-09 04:23:41,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:41,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:41,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:23:41,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:23:41,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:41,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:42,051 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:23:42,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:42,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983264661] [2025-01-09 04:23:42,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983264661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:42,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:42,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:23:42,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615481119] [2025-01-09 04:23:42,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:42,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:23:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:42,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:23:42,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:23:42,077 INFO L87 Difference]: Start difference. First operand has 120 states, 118 states have (on average 1.7627118644067796) internal successors, (208), 119 states have internal predecessors, (208), 0 states have call successors, (0), 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 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:23:42,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:42,198 INFO L93 Difference]: Finished difference Result 197 states and 332 transitions. [2025-01-09 04:23:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:23:42,203 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:23:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:42,210 INFO L225 Difference]: With dead ends: 197 [2025-01-09 04:23:42,210 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 04:23:42,215 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:23:42,217 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:42,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 770 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:42,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 04:23:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 04:23:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.396551724137931) internal successors, (162), 116 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 162 transitions. [2025-01-09 04:23:42,247 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 162 transitions. Word has length 37 [2025-01-09 04:23:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:42,247 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 162 transitions. [2025-01-09 04:23:42,247 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:23:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 162 transitions. [2025-01-09 04:23:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:23:42,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:42,249 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:23:42,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:23:42,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:42,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash -692236649, now seen corresponding path program 1 times [2025-01-09 04:23:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:42,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446225706] [2025-01-09 04:23:42,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:42,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:42,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:23:42,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:23:42,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:42,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:42,460 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:23:42,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:42,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446225706] [2025-01-09 04:23:42,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446225706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:42,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:42,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:42,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688384792] [2025-01-09 04:23:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:42,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:42,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:42,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:42,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:42,462 INFO L87 Difference]: Start difference. First operand 117 states and 162 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:23:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:42,501 INFO L93 Difference]: Finished difference Result 249 states and 378 transitions. [2025-01-09 04:23:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:42,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:23:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:42,506 INFO L225 Difference]: With dead ends: 249 [2025-01-09 04:23:42,507 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 04:23:42,507 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:23:42,508 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 99 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 358 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:23:42,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 04:23:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2025-01-09 04:23:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.4829545454545454) internal successors, (261), 176 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:23:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 261 transitions. [2025-01-09 04:23:42,525 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 261 transitions. Word has length 77 [2025-01-09 04:23:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:42,526 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 261 transitions. [2025-01-09 04:23:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:23:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 261 transitions. [2025-01-09 04:23:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:23:42,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:42,531 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:23:42,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:23:42,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:42,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 912681560, now seen corresponding path program 1 times [2025-01-09 04:23:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:42,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071003979] [2025-01-09 04:23:42,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:42,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:42,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:23:42,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:23:42,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:42,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:42,674 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:23:42,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:42,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071003979] [2025-01-09 04:23:42,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071003979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:42,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:42,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:42,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109202549] [2025-01-09 04:23:42,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:42,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:42,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:42,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:42,676 INFO L87 Difference]: Start difference. First operand 177 states and 261 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:23:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:42,711 INFO L93 Difference]: Finished difference Result 421 states and 661 transitions. [2025-01-09 04:23:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:23:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:42,714 INFO L225 Difference]: With dead ends: 421 [2025-01-09 04:23:42,714 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 04:23:42,715 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:23:42,715 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 95 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 355 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:23:42,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 355 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:42,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 04:23:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-01-09 04:23:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 1.5416666666666667) internal successors, (444), 288 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:23:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 444 transitions. [2025-01-09 04:23:42,741 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 444 transitions. Word has length 77 [2025-01-09 04:23:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:42,741 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 444 transitions. [2025-01-09 04:23:42,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:23:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 444 transitions. [2025-01-09 04:23:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:23:42,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:42,746 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:23:42,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:23:42,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:42,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:42,746 INFO L85 PathProgramCache]: Analyzing trace with hash 313364121, now seen corresponding path program 1 times [2025-01-09 04:23:42,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:42,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598766998] [2025-01-09 04:23:42,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:42,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:42,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:23:42,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:23:42,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:42,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:42,944 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:23:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598766998] [2025-01-09 04:23:42,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598766998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780173959] [2025-01-09 04:23:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:42,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:42,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:42,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:42,948 INFO L87 Difference]: Start difference. First operand 289 states and 444 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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:23:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:42,980 INFO L93 Difference]: Finished difference Result 741 states and 1182 transitions. [2025-01-09 04:23:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:42,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:23:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:42,986 INFO L225 Difference]: With dead ends: 741 [2025-01-09 04:23:42,986 INFO L226 Difference]: Without dead ends: 499 [2025-01-09 04:23:42,987 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:23:42,991 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 83 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 326 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:23:42,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 326 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-01-09 04:23:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2025-01-09 04:23:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.5725806451612903) internal successors, (780), 496 states have internal predecessors, (780), 0 states have call successors, (0), 0 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:23:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 780 transitions. [2025-01-09 04:23:43,023 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 780 transitions. Word has length 77 [2025-01-09 04:23:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:43,024 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 780 transitions. [2025-01-09 04:23:43,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:23:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 780 transitions. [2025-01-09 04:23:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 04:23:43,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:43,028 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:23:43,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:23:43,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -580891558, now seen corresponding path program 1 times [2025-01-09 04:23:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682701636] [2025-01-09 04:23:43,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:43,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 04:23:43,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 04:23:43,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:43,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:43,327 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:23:43,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:43,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682701636] [2025-01-09 04:23:43,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682701636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:43,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:43,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:23:43,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303782175] [2025-01-09 04:23:43,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:43,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:23:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:43,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:23:43,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:23:43,329 INFO L87 Difference]: Start difference. First operand 497 states and 780 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:23:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:43,578 INFO L93 Difference]: Finished difference Result 3647 states and 5911 transitions. [2025-01-09 04:23:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:23:43,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:23:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:43,596 INFO L225 Difference]: With dead ends: 3647 [2025-01-09 04:23:43,597 INFO L226 Difference]: Without dead ends: 3197 [2025-01-09 04:23:43,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:23:43,600 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1866 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:43,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1866 Valid, 1410 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:23:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2025-01-09 04:23:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 945. [2025-01-09 04:23:43,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 1.5847457627118644) internal successors, (1496), 944 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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:23:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1496 transitions. [2025-01-09 04:23:43,671 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1496 transitions. Word has length 77 [2025-01-09 04:23:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:43,672 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1496 transitions. [2025-01-09 04:23:43,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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:23:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1496 transitions. [2025-01-09 04:23:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 04:23:43,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:43,674 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] [2025-01-09 04:23:43,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:23:43,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:43,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:43,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1211092305, now seen corresponding path program 1 times [2025-01-09 04:23:43,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:43,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009373146] [2025-01-09 04:23:43,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:43,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 04:23:43,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 04:23:43,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:43,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:44,034 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:23:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:44,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009373146] [2025-01-09 04:23:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009373146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:44,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:44,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:23:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791068820] [2025-01-09 04:23:44,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:44,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:23:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:44,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:23:44,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:23:44,038 INFO L87 Difference]: Start difference. First operand 945 states and 1496 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:23:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:44,075 INFO L93 Difference]: Finished difference Result 995 states and 1561 transitions. [2025-01-09 04:23:44,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:23:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-01-09 04:23:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:44,079 INFO L225 Difference]: With dead ends: 995 [2025-01-09 04:23:44,080 INFO L226 Difference]: Without dead ends: 993 [2025-01-09 04:23:44,080 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:23:44,082 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:44,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-01-09 04:23:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2025-01-09 04:23:44,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 992 states have (on average 1.5564516129032258) internal successors, (1544), 992 states have internal predecessors, (1544), 0 states have call successors, (0), 0 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:23:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1544 transitions. [2025-01-09 04:23:44,125 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1544 transitions. Word has length 78 [2025-01-09 04:23:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:44,125 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1544 transitions. [2025-01-09 04:23:44,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:23:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1544 transitions. [2025-01-09 04:23:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:23:44,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:44,128 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] [2025-01-09 04:23:44,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:23:44,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:44,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1163422930, now seen corresponding path program 1 times [2025-01-09 04:23:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25331074] [2025-01-09 04:23:44,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:44,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:23:44,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:23:44,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:44,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:44,230 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:23:44,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:44,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25331074] [2025-01-09 04:23:44,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25331074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:44,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:44,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370282635] [2025-01-09 04:23:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:44,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:44,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:44,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:44,232 INFO L87 Difference]: Start difference. First operand 993 states and 1544 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:44,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:44,292 INFO L93 Difference]: Finished difference Result 2765 states and 4338 transitions. [2025-01-09 04:23:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:44,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:23:44,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:44,301 INFO L225 Difference]: With dead ends: 2765 [2025-01-09 04:23:44,301 INFO L226 Difference]: Without dead ends: 1819 [2025-01-09 04:23:44,302 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:23:44,303 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 76 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:44,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 274 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:44,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2025-01-09 04:23:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1817. [2025-01-09 04:23:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1816 states have (on average 1.5550660792951543) internal successors, (2824), 1816 states have internal predecessors, (2824), 0 states have call successors, (0), 0 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:23:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2824 transitions. [2025-01-09 04:23:44,374 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2824 transitions. Word has length 79 [2025-01-09 04:23:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:44,375 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2824 transitions. [2025-01-09 04:23:44,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2824 transitions. [2025-01-09 04:23:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 04:23:44,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:44,376 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] [2025-01-09 04:23:44,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:23:44,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:44,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash -560142895, now seen corresponding path program 1 times [2025-01-09 04:23:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:44,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982928181] [2025-01-09 04:23:44,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:44,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:44,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 04:23:44,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 04:23:44,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:44,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:44,470 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:23:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:44,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982928181] [2025-01-09 04:23:44,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982928181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718202979] [2025-01-09 04:23:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:44,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:44,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:44,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:44,471 INFO L87 Difference]: Start difference. First operand 1817 states and 2824 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:44,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:44,529 INFO L93 Difference]: Finished difference Result 3583 states and 5597 transitions. [2025-01-09 04:23:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:44,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 04:23:44,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:44,541 INFO L225 Difference]: With dead ends: 3583 [2025-01-09 04:23:44,542 INFO L226 Difference]: Without dead ends: 2637 [2025-01-09 04:23:44,546 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:23:44,547 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 103 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 368 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:23:44,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 368 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2025-01-09 04:23:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2635. [2025-01-09 04:23:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.5497342444950646) internal successors, (4082), 2634 states have internal predecessors, (4082), 0 states have call successors, (0), 0 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:23:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 4082 transitions. [2025-01-09 04:23:44,630 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 4082 transitions. Word has length 79 [2025-01-09 04:23:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:44,632 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 4082 transitions. [2025-01-09 04:23:44,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:23:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 4082 transitions. [2025-01-09 04:23:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:23:44,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:44,633 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:23:44,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:23:44,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:44,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1128426904, now seen corresponding path program 1 times [2025-01-09 04:23:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732630261] [2025-01-09 04:23:44,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:44,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:23:44,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:23:44,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:44,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:44,702 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:23:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732630261] [2025-01-09 04:23:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732630261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:44,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:44,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:44,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441025931] [2025-01-09 04:23:44,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:44,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:44,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:44,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:44,705 INFO L87 Difference]: Start difference. First operand 2635 states and 4082 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:23:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:44,807 INFO L93 Difference]: Finished difference Result 7423 states and 11476 transitions. [2025-01-09 04:23:44,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:44,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:23:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:44,827 INFO L225 Difference]: With dead ends: 7423 [2025-01-09 04:23:44,828 INFO L226 Difference]: Without dead ends: 4837 [2025-01-09 04:23:44,832 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:23:44,833 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 87 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 349 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:23:44,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 349 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4837 states. [2025-01-09 04:23:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4837 to 4835. [2025-01-09 04:23:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4835 states, 4834 states have (on average 1.5295821266032272) internal successors, (7394), 4834 states have internal predecessors, (7394), 0 states have call successors, (0), 0 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:23:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4835 states to 4835 states and 7394 transitions. [2025-01-09 04:23:45,018 INFO L78 Accepts]: Start accepts. Automaton has 4835 states and 7394 transitions. Word has length 80 [2025-01-09 04:23:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:45,018 INFO L471 AbstractCegarLoop]: Abstraction has 4835 states and 7394 transitions. [2025-01-09 04:23:45,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:23:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4835 states and 7394 transitions. [2025-01-09 04:23:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 04:23:45,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:45,019 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:23:45,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:23:45,020 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:45,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:45,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1809370440, now seen corresponding path program 1 times [2025-01-09 04:23:45,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:45,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421836362] [2025-01-09 04:23:45,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:45,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:45,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 04:23:45,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 04:23:45,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:45,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:45,088 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:23:45,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:45,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421836362] [2025-01-09 04:23:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421836362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795461118] [2025-01-09 04:23:45,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:45,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:45,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:45,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:45,090 INFO L87 Difference]: Start difference. First operand 4835 states and 7394 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:23:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:45,243 INFO L93 Difference]: Finished difference Result 13639 states and 20740 transitions. [2025-01-09 04:23:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:45,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:23:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:45,277 INFO L225 Difference]: With dead ends: 13639 [2025-01-09 04:23:45,277 INFO L226 Difference]: Without dead ends: 8853 [2025-01-09 04:23:45,285 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:23:45,285 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 91 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 362 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:23:45,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2025-01-09 04:23:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 8851. [2025-01-09 04:23:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 8850 states have (on average 1.5025988700564972) internal successors, (13298), 8850 states have internal predecessors, (13298), 0 states have call successors, (0), 0 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:23:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 13298 transitions. [2025-01-09 04:23:45,605 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 13298 transitions. Word has length 80 [2025-01-09 04:23:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:45,605 INFO L471 AbstractCegarLoop]: Abstraction has 8851 states and 13298 transitions. [2025-01-09 04:23:45,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:23:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 13298 transitions. [2025-01-09 04:23:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:23:45,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:45,616 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, 1, 1, 1] [2025-01-09 04:23:45,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:23:45,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:45,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:45,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1844217243, now seen corresponding path program 1 times [2025-01-09 04:23:45,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:45,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031064581] [2025-01-09 04:23:45,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:45,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:45,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:23:45,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:23:45,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:45,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:45,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:45,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031064581] [2025-01-09 04:23:45,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031064581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:45,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:45,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:45,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228653948] [2025-01-09 04:23:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:45,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:45,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:45,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:45,762 INFO L87 Difference]: Start difference. First operand 8851 states and 13298 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:23:45,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:45,936 INFO L93 Difference]: Finished difference Result 17655 states and 26548 transitions. [2025-01-09 04:23:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:45,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-01-09 04:23:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:45,973 INFO L225 Difference]: With dead ends: 17655 [2025-01-09 04:23:45,974 INFO L226 Difference]: Without dead ends: 8853 [2025-01-09 04:23:45,984 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:23:45,985 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 80 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:45,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 356 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2025-01-09 04:23:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 8851. [2025-01-09 04:23:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 8850 states have (on average 1.4917514124293785) internal successors, (13202), 8850 states have internal predecessors, (13202), 0 states have call successors, (0), 0 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:23:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 13202 transitions. [2025-01-09 04:23:46,256 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 13202 transitions. Word has length 110 [2025-01-09 04:23:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:46,256 INFO L471 AbstractCegarLoop]: Abstraction has 8851 states and 13202 transitions. [2025-01-09 04:23:46,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:23:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 13202 transitions. [2025-01-09 04:23:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:23:46,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:46,259 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:46,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:23:46,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:46,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1051245286, now seen corresponding path program 1 times [2025-01-09 04:23:46,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:46,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190000344] [2025-01-09 04:23:46,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:46,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:23:46,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:23:46,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:46,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:46,404 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:23:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190000344] [2025-01-09 04:23:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190000344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:23:46,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:23:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:23:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737968498] [2025-01-09 04:23:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:23:46,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:23:46,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:46,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:23:46,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:23:46,406 INFO L87 Difference]: Start difference. First operand 8851 states and 13202 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:23:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:46,519 INFO L93 Difference]: Finished difference Result 13255 states and 19780 transitions. [2025-01-09 04:23:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:23:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-01-09 04:23:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:23:46,530 INFO L225 Difference]: With dead ends: 13255 [2025-01-09 04:23:46,530 INFO L226 Difference]: Without dead ends: 4453 [2025-01-09 04:23:46,539 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:23:46,540 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 74 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:23:46,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 337 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:23:46,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2025-01-09 04:23:46,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4451. [2025-01-09 04:23:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4451 states, 4450 states have (on average 1.4782022471910112) internal successors, (6578), 4450 states have internal predecessors, (6578), 0 states have call successors, (0), 0 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:23:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4451 states to 4451 states and 6578 transitions. [2025-01-09 04:23:46,660 INFO L78 Accepts]: Start accepts. Automaton has 4451 states and 6578 transitions. Word has length 110 [2025-01-09 04:23:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:23:46,660 INFO L471 AbstractCegarLoop]: Abstraction has 4451 states and 6578 transitions. [2025-01-09 04:23:46,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:23:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4451 states and 6578 transitions. [2025-01-09 04:23:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 04:23:46,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:23:46,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:23:46,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:23:46,664 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:23:46,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:23:46,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1758698521, now seen corresponding path program 1 times [2025-01-09 04:23:46,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:23:46,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766199221] [2025-01-09 04:23:46,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:46,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:23:46,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:23:46,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:23:46,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:46,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:48,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:23:48,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766199221] [2025-01-09 04:23:48,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766199221] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:23:48,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298735053] [2025-01-09 04:23:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:23:48,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:23:48,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:23:48,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:23:48,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:23:48,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 04:23:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 04:23:48,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:23:48,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:23:48,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 04:23:48,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:23:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:48,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:23:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:23:49,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298735053] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:23:49,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:23:49,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 8] total 23 [2025-01-09 04:23:49,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732074971] [2025-01-09 04:23:49,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:23:49,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 04:23:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:23:49,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 04:23:49,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:23:49,725 INFO L87 Difference]: Start difference. First operand 4451 states and 6578 transitions. Second operand has 23 states, 23 states have (on average 14.043478260869565) internal successors, (323), 23 states have internal predecessors, (323), 0 states have call successors, (0), 0 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:23:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:23:59,980 INFO L93 Difference]: Finished difference Result 67313 states and 99913 transitions. [2025-01-09 04:23:59,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2025-01-09 04:23:59,981 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 14.043478260869565) internal successors, (323), 23 states have internal predecessors, (323), 0 states have call successors, (0), 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 110 [2025-01-09 04:23:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:00,128 INFO L225 Difference]: With dead ends: 67313 [2025-01-09 04:24:00,129 INFO L226 Difference]: Without dead ends: 64303 [2025-01-09 04:24:00,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13770 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=4234, Invalid=29806, Unknown=0, NotChecked=0, Total=34040 [2025-01-09 04:24:00,156 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 11496 mSDsluCounter, 4652 mSDsCounter, 0 mSdLazyCounter, 3945 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11496 SdHoareTripleChecker+Valid, 5057 SdHoareTripleChecker+Invalid, 4049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 3945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:00,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11496 Valid, 5057 Invalid, 4049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 3945 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 04:24:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64303 states. [2025-01-09 04:24:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64303 to 40707. [2025-01-09 04:24:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40707 states, 40706 states have (on average 1.4598830639217806) internal successors, (59426), 40706 states have internal predecessors, (59426), 0 states have call successors, (0), 0 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:24:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40707 states to 40707 states and 59426 transitions. [2025-01-09 04:24:01,365 INFO L78 Accepts]: Start accepts. Automaton has 40707 states and 59426 transitions. Word has length 110 [2025-01-09 04:24:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:01,365 INFO L471 AbstractCegarLoop]: Abstraction has 40707 states and 59426 transitions. [2025-01-09 04:24:01,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.043478260869565) internal successors, (323), 23 states have internal predecessors, (323), 0 states have call successors, (0), 0 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:24:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 40707 states and 59426 transitions. [2025-01-09 04:24:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:01,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:01,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:01,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:24:01,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 04:24:01,570 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:01,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:01,571 INFO L85 PathProgramCache]: Analyzing trace with hash 527929303, now seen corresponding path program 1 times [2025-01-09 04:24:01,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:01,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510239465] [2025-01-09 04:24:01,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:01,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:01,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:01,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:01,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:24:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510239465] [2025-01-09 04:24:01,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510239465] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:01,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:01,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:01,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373542140] [2025-01-09 04:24:01,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:01,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:01,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:01,789 INFO L87 Difference]: Start difference. First operand 40707 states and 59426 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 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:24:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:03,915 INFO L93 Difference]: Finished difference Result 163561 states and 239817 transitions. [2025-01-09 04:24:03,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:03,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 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 111 [2025-01-09 04:24:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:04,166 INFO L225 Difference]: With dead ends: 163561 [2025-01-09 04:24:04,167 INFO L226 Difference]: Without dead ends: 142487 [2025-01-09 04:24:04,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:04,210 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 1160 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:04,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1763 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:04,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142487 states. [2025-01-09 04:24:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142487 to 60843. [2025-01-09 04:24:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60843 states, 60842 states have (on average 1.456395253278985) internal successors, (88610), 60842 states have internal predecessors, (88610), 0 states have call successors, (0), 0 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:24:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60843 states to 60843 states and 88610 transitions. [2025-01-09 04:24:06,080 INFO L78 Accepts]: Start accepts. Automaton has 60843 states and 88610 transitions. Word has length 111 [2025-01-09 04:24:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:06,082 INFO L471 AbstractCegarLoop]: Abstraction has 60843 states and 88610 transitions. [2025-01-09 04:24:06,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 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:24:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 60843 states and 88610 transitions. [2025-01-09 04:24:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:06,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:06,086 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:06,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:24:06,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:06,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 977770649, now seen corresponding path program 1 times [2025-01-09 04:24:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:06,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342791668] [2025-01-09 04:24:06,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:06,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:06,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:06,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:06,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:06,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:06,275 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:24:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342791668] [2025-01-09 04:24:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342791668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:06,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:06,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485078030] [2025-01-09 04:24:06,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:06,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:06,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:06,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:06,279 INFO L87 Difference]: Start difference. First operand 60843 states and 88610 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:24:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:08,634 INFO L93 Difference]: Finished difference Result 183697 states and 269001 transitions. [2025-01-09 04:24:08,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:08,634 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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 111 [2025-01-09 04:24:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:08,844 INFO L225 Difference]: With dead ends: 183697 [2025-01-09 04:24:08,844 INFO L226 Difference]: Without dead ends: 162623 [2025-01-09 04:24:08,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:08,896 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 1209 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:08,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 1615 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:09,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162623 states. [2025-01-09 04:24:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162623 to 80979. [2025-01-09 04:24:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80979 states, 80978 states have (on average 1.4546420015312802) internal successors, (117794), 80978 states have internal predecessors, (117794), 0 states have call successors, (0), 0 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:24:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80979 states to 80979 states and 117794 transitions. [2025-01-09 04:24:11,028 INFO L78 Accepts]: Start accepts. Automaton has 80979 states and 117794 transitions. Word has length 111 [2025-01-09 04:24:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 80979 states and 117794 transitions. [2025-01-09 04:24:11,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:24:11,029 INFO L276 IsEmpty]: Start isEmpty. Operand 80979 states and 117794 transitions. [2025-01-09 04:24:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:11,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:11,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:11,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:24:11,034 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:11,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:11,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1636937125, now seen corresponding path program 1 times [2025-01-09 04:24:11,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:11,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585151579] [2025-01-09 04:24:11,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:11,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:11,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:11,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:11,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:11,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:24:11,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:11,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585151579] [2025-01-09 04:24:11,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585151579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:11,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:11,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8173790] [2025-01-09 04:24:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:11,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:11,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:11,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:11,213 INFO L87 Difference]: Start difference. First operand 80979 states and 117794 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:14,753 INFO L93 Difference]: Finished difference Result 203833 states and 298185 transitions. [2025-01-09 04:24:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:14,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-01-09 04:24:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:14,954 INFO L225 Difference]: With dead ends: 203833 [2025-01-09 04:24:14,954 INFO L226 Difference]: Without dead ends: 182759 [2025-01-09 04:24:14,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:14,993 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 1294 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:14,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1515 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182759 states. [2025-01-09 04:24:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182759 to 101115. [2025-01-09 04:24:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101115 states, 101114 states have (on average 1.453587040370275) internal successors, (146978), 101114 states have internal predecessors, (146978), 0 states have call successors, (0), 0 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:24:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101115 states to 101115 states and 146978 transitions. [2025-01-09 04:24:17,864 INFO L78 Accepts]: Start accepts. Automaton has 101115 states and 146978 transitions. Word has length 111 [2025-01-09 04:24:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:24:17,865 INFO L471 AbstractCegarLoop]: Abstraction has 101115 states and 146978 transitions. [2025-01-09 04:24:17,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:24:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 101115 states and 146978 transitions. [2025-01-09 04:24:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 04:24:17,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:24:17,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:24:17,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:24:17,871 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:24:17,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:24:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1662239459, now seen corresponding path program 1 times [2025-01-09 04:24:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:24:17,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934547210] [2025-01-09 04:24:17,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:24:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:24:17,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 04:24:17,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 04:24:17,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:24:17,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:24:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:24:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:24:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934547210] [2025-01-09 04:24:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934547210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:24:18,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:24:18,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:24:18,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798334784] [2025-01-09 04:24:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:24:18,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:24:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:24:18,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:24:18,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:24:18,090 INFO L87 Difference]: Start difference. First operand 101115 states and 146978 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:24:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:24:21,652 INFO L93 Difference]: Finished difference Result 223969 states and 327369 transitions. [2025-01-09 04:24:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:24:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 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 111 [2025-01-09 04:24:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:24:21,922 INFO L225 Difference]: With dead ends: 223969 [2025-01-09 04:24:21,922 INFO L226 Difference]: Without dead ends: 202895 [2025-01-09 04:24:21,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:24:21,977 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1387 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:24:21,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 1579 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:24:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202895 states.