./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label35.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e81bbc4430f76a90c5e02a887d03761648c221c2fd9f1be76d3af26cf9b24c3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:47:35,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:47:35,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:47:35,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:47:35,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:47:35,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:47:35,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:47:35,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:47:35,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:47:35,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:47:35,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:47:35,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:47:35,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:47:35,270 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:47:35,271 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:47:35,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:47:35,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:47:35,272 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:47:35,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:47:35,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:47:35,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:47:35,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:47:35,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:47:35,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:47:35,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:47:35,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:47:35,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:47:35,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:47:35,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:47:35,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:47:35,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:47:35,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:47:35,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:47:35,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:47:35,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:47:35,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:47:35,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:47:35,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:47:35,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:47:35,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:47:35,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:47:35,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:47:35,283 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> e81bbc4430f76a90c5e02a887d03761648c221c2fd9f1be76d3af26cf9b24c3e [2024-10-10 23:47:35,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:47:35,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:47:35,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:47:35,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:47:35,565 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:47:35,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label35.c [2024-10-10 23:47:37,072 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:47:37,471 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:47:37,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label35.c [2024-10-10 23:47:37,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c1aa24b0/0a1acb40885548589991f0b79210a964/FLAG77661c061 [2024-10-10 23:47:37,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c1aa24b0/0a1acb40885548589991f0b79210a964 [2024-10-10 23:47:37,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:47:37,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:47:37,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:47:37,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:47:37,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:47:37,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:47:37" (1/1) ... [2024-10-10 23:47:37,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d952843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:37, skipping insertion in model container [2024-10-10 23:47:37,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:47:37" (1/1) ... [2024-10-10 23:47:37,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:47:37,843 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label35.c[1267,1280] [2024-10-10 23:47:38,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:47:38,375 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:47:38,393 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label35.c[1267,1280] [2024-10-10 23:47:38,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:47:38,757 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:47:38,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38 WrapperNode [2024-10-10 23:47:38,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:47:38,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:47:38,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:47:38,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:47:38,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:38,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,172 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:47:39,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:47:39,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:47:39,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:47:39,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:47:39,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,351 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]. [2024-10-10 23:47:39,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:47:39,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:47:39,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:47:39,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:47:39,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (1/1) ... [2024-10-10 23:47:39,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:47:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:47:39,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:47:39,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:47:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:47:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:47:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:47:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:47:39,699 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:47:39,701 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:47:43,084 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:47:43,085 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:47:43,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:47:43,148 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:47:43,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:47:43 BoogieIcfgContainer [2024-10-10 23:47:43,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:47:43,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:47:43,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:47:43,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:47:43,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:47:37" (1/3) ... [2024-10-10 23:47:43,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5586ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:47:43, skipping insertion in model container [2024-10-10 23:47:43,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:47:38" (2/3) ... [2024-10-10 23:47:43,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5586ed48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:47:43, skipping insertion in model container [2024-10-10 23:47:43,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:47:43" (3/3) ... [2024-10-10 23:47:43,158 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label35.c [2024-10-10 23:47:43,174 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:47:43,174 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:47:43,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:47:43,278 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;@6330e0bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:47:43,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:47:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-10 23:47:43,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:43,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-10 23:47:43,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:43,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:43,301 INFO L85 PathProgramCache]: Analyzing trace with hash -28674423, now seen corresponding path program 1 times [2024-10-10 23:47:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713177306] [2024-10-10 23:47:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:43,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713177306] [2024-10-10 23:47:43,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713177306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:43,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:43,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:43,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812844120] [2024-10-10 23:47:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:43,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:43,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:43,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:43,552 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:45,822 INFO L93 Difference]: Finished difference Result 1507 states and 2892 transitions. [2024-10-10 23:47:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:45,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-10 23:47:45,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:45,841 INFO L225 Difference]: With dead ends: 1507 [2024-10-10 23:47:45,841 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:47:45,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:45,851 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 467 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:45,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 450 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:47:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:47:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-10 23:47:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-10 23:47:45,928 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 6 [2024-10-10 23:47:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:45,928 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-10 23:47:45,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-10 23:47:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-10 23:47:45,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:45,931 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:45,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:47:45,932 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash 884233218, now seen corresponding path program 1 times [2024-10-10 23:47:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:45,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057980141] [2024-10-10 23:47:45,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:45,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:46,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057980141] [2024-10-10 23:47:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057980141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:46,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:46,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:46,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953718951] [2024-10-10 23:47:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:46,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:46,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:46,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:46,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:46,236 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:48,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:48,166 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2024-10-10 23:47:48,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:48,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-10-10 23:47:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:48,175 INFO L225 Difference]: With dead ends: 2812 [2024-10-10 23:47:48,175 INFO L226 Difference]: Without dead ends: 1843 [2024-10-10 23:47:48,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:48,179 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:48,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 577 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:47:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2024-10-10 23:47:48,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2024-10-10 23:47:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2024-10-10 23:47:48,230 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 73 [2024-10-10 23:47:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:48,231 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2024-10-10 23:47:48,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2024-10-10 23:47:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-10 23:47:48,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:48,233 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:48,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:47:48,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:48,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1019077052, now seen corresponding path program 1 times [2024-10-10 23:47:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:48,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919027463] [2024-10-10 23:47:48,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:48,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:48,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:48,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919027463] [2024-10-10 23:47:48,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919027463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:48,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:48,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912989263] [2024-10-10 23:47:48,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:48,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:48,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:48,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:48,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:48,503 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:50,541 INFO L93 Difference]: Finished difference Result 4551 states and 6281 transitions. [2024-10-10 23:47:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:50,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-10-10 23:47:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:50,551 INFO L225 Difference]: With dead ends: 4551 [2024-10-10 23:47:50,551 INFO L226 Difference]: Without dead ends: 2712 [2024-10-10 23:47:50,555 INFO L431 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 [2024-10-10 23:47:50,558 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 500 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:50,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 883 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [415 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:47:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2024-10-10 23:47:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2710. [2024-10-10 23:47:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.3004798818752308) internal successors, (3523), 2709 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3523 transitions. [2024-10-10 23:47:50,614 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3523 transitions. Word has length 76 [2024-10-10 23:47:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:50,616 INFO L471 AbstractCegarLoop]: Abstraction has 2710 states and 3523 transitions. [2024-10-10 23:47:50,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3523 transitions. [2024-10-10 23:47:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-10 23:47:50,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:50,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:47:50,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1451564948, now seen corresponding path program 1 times [2024-10-10 23:47:50,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:50,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853916474] [2024-10-10 23:47:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:47:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853916474] [2024-10-10 23:47:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853916474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:47:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726196345] [2024-10-10 23:47:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:50,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:50,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:50,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:50,888 INFO L87 Difference]: Start difference. First operand 2710 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 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) [2024-10-10 23:47:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:52,751 INFO L93 Difference]: Finished difference Result 7983 states and 10360 transitions. [2024-10-10 23:47:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:52,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 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 145 [2024-10-10 23:47:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:52,768 INFO L225 Difference]: With dead ends: 7983 [2024-10-10 23:47:52,768 INFO L226 Difference]: Without dead ends: 4420 [2024-10-10 23:47:52,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:52,777 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:52,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:47:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-10-10 23:47:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3570. [2024-10-10 23:47:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 3569 states have (on average 1.177640795741104) internal successors, (4203), 3569 states have internal predecessors, (4203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 4203 transitions. [2024-10-10 23:47:52,836 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 4203 transitions. Word has length 145 [2024-10-10 23:47:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:52,837 INFO L471 AbstractCegarLoop]: Abstraction has 3570 states and 4203 transitions. [2024-10-10 23:47:52,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 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) [2024-10-10 23:47:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 4203 transitions. [2024-10-10 23:47:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-10 23:47:52,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:52,842 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:52,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:47:52,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:52,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:52,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1408080026, now seen corresponding path program 1 times [2024-10-10 23:47:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542053722] [2024-10-10 23:47:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:47:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542053722] [2024-10-10 23:47:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542053722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:53,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724209967] [2024-10-10 23:47:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:53,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:53,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:53,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:53,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:53,075 INFO L87 Difference]: Start difference. First operand 3570 states and 4203 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:54,526 INFO L93 Difference]: Finished difference Result 9272 states and 11086 transitions. [2024-10-10 23:47:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:54,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-10-10 23:47:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:54,544 INFO L225 Difference]: With dead ends: 9272 [2024-10-10 23:47:54,545 INFO L226 Difference]: Without dead ends: 5703 [2024-10-10 23:47:54,549 INFO L431 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 [2024-10-10 23:47:54,550 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:54,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 781 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:47:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2024-10-10 23:47:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5703. [2024-10-10 23:47:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 5702 states have (on average 1.1595931252192213) internal successors, (6612), 5702 states have internal predecessors, (6612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 6612 transitions. [2024-10-10 23:47:54,642 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 6612 transitions. Word has length 158 [2024-10-10 23:47:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:54,642 INFO L471 AbstractCegarLoop]: Abstraction has 5703 states and 6612 transitions. [2024-10-10 23:47:54,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 6612 transitions. [2024-10-10 23:47:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-10 23:47:54,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:54,645 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:54,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:47:54,645 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:54,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2014099829, now seen corresponding path program 1 times [2024-10-10 23:47:54,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:54,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302475611] [2024-10-10 23:47:54,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:54,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:47:54,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:54,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302475611] [2024-10-10 23:47:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302475611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:54,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:54,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839146883] [2024-10-10 23:47:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:54,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:54,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:54,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:54,782 INFO L87 Difference]: Start difference. First operand 5703 states and 6612 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:56,315 INFO L93 Difference]: Finished difference Result 14375 states and 16775 transitions. [2024-10-10 23:47:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:56,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 160 [2024-10-10 23:47:56,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:56,341 INFO L225 Difference]: With dead ends: 14375 [2024-10-10 23:47:56,342 INFO L226 Difference]: Without dead ends: 8672 [2024-10-10 23:47:56,349 INFO L431 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 [2024-10-10 23:47:56,350 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 443 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:56,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 442 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:47:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2024-10-10 23:47:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 5676. [2024-10-10 23:47:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 5675 states have (on average 1.157885462555066) internal successors, (6571), 5675 states have internal predecessors, (6571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 6571 transitions. [2024-10-10 23:47:56,460 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 6571 transitions. Word has length 160 [2024-10-10 23:47:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:56,461 INFO L471 AbstractCegarLoop]: Abstraction has 5676 states and 6571 transitions. [2024-10-10 23:47:56,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:56,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 6571 transitions. [2024-10-10 23:47:56,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-10-10 23:47:56,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:56,468 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:56,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:47:56,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:56,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1323127433, now seen corresponding path program 1 times [2024-10-10 23:47:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:56,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242854196] [2024-10-10 23:47:56,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:56,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-10 23:47:56,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:56,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242854196] [2024-10-10 23:47:56,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242854196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:56,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:56,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776990695] [2024-10-10 23:47:56,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:56,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:56,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:56,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:56,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:56,725 INFO L87 Difference]: Start difference. First operand 5676 states and 6571 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:58,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:47:58,273 INFO L93 Difference]: Finished difference Result 14314 states and 16679 transitions. [2024-10-10 23:47:58,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:47:58,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 238 [2024-10-10 23:47:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:47:58,310 INFO L225 Difference]: With dead ends: 14314 [2024-10-10 23:47:58,312 INFO L226 Difference]: Without dead ends: 7789 [2024-10-10 23:47:58,319 INFO L431 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 [2024-10-10 23:47:58,321 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:47:58,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 844 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:47:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7789 states. [2024-10-10 23:47:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7789 to 7789. [2024-10-10 23:47:58,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7789 states, 7788 states have (on average 1.11864406779661) internal successors, (8712), 7788 states have internal predecessors, (8712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7789 states to 7789 states and 8712 transitions. [2024-10-10 23:47:58,443 INFO L78 Accepts]: Start accepts. Automaton has 7789 states and 8712 transitions. Word has length 238 [2024-10-10 23:47:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:47:58,443 INFO L471 AbstractCegarLoop]: Abstraction has 7789 states and 8712 transitions. [2024-10-10 23:47:58,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:47:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7789 states and 8712 transitions. [2024-10-10 23:47:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-10-10 23:47:58,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:47:58,447 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:47:58,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:47:58,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:47:58,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:47:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 842591716, now seen corresponding path program 1 times [2024-10-10 23:47:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:47:58,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959346302] [2024-10-10 23:47:58,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:47:58,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:47:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:47:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-10 23:47:58,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:47:58,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959346302] [2024-10-10 23:47:58,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959346302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:47:58,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:47:58,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:47:58,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354009135] [2024-10-10 23:47:58,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:47:58,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:47:58,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:47:58,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:47:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:47:58,712 INFO L87 Difference]: Start difference. First operand 7789 states and 8712 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:00,430 INFO L93 Difference]: Finished difference Result 18558 states and 20912 transitions. [2024-10-10 23:48:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 278 [2024-10-10 23:48:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:00,455 INFO L225 Difference]: With dead ends: 18558 [2024-10-10 23:48:00,456 INFO L226 Difference]: Without dead ends: 10770 [2024-10-10 23:48:00,464 INFO L431 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 [2024-10-10 23:48:00,465 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 464 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:00,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 400 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:48:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10770 states. [2024-10-10 23:48:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10770 to 9915. [2024-10-10 23:48:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9915 states, 9914 states have (on average 1.1194270728263063) internal successors, (11098), 9914 states have internal predecessors, (11098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:00,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9915 states to 9915 states and 11098 transitions. [2024-10-10 23:48:00,591 INFO L78 Accepts]: Start accepts. Automaton has 9915 states and 11098 transitions. Word has length 278 [2024-10-10 23:48:00,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:00,592 INFO L471 AbstractCegarLoop]: Abstraction has 9915 states and 11098 transitions. [2024-10-10 23:48:00,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 9915 states and 11098 transitions. [2024-10-10 23:48:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-10 23:48:00,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:00,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:00,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:48:00,599 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:00,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:00,599 INFO L85 PathProgramCache]: Analyzing trace with hash 140259748, now seen corresponding path program 1 times [2024-10-10 23:48:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:00,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062905376] [2024-10-10 23:48:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:00,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:01,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062905376] [2024-10-10 23:48:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062905376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517162111] [2024-10-10 23:48:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:01,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:01,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:01,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:01,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:01,006 INFO L87 Difference]: Start difference. First operand 9915 states and 11098 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:03,530 INFO L93 Difference]: Finished difference Result 26238 states and 29413 transitions. [2024-10-10 23:48:03,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:03,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 345 [2024-10-10 23:48:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:03,563 INFO L225 Difference]: With dead ends: 26238 [2024-10-10 23:48:03,563 INFO L226 Difference]: Without dead ends: 15899 [2024-10-10 23:48:03,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:03,578 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 668 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:03,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 194 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:48:03,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15899 states. [2024-10-10 23:48:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15899 to 15897. [2024-10-10 23:48:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15897 states, 15896 states have (on average 1.1247483643683946) internal successors, (17879), 15896 states have internal predecessors, (17879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15897 states to 15897 states and 17879 transitions. [2024-10-10 23:48:03,800 INFO L78 Accepts]: Start accepts. Automaton has 15897 states and 17879 transitions. Word has length 345 [2024-10-10 23:48:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:03,802 INFO L471 AbstractCegarLoop]: Abstraction has 15897 states and 17879 transitions. [2024-10-10 23:48:03,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 15897 states and 17879 transitions. [2024-10-10 23:48:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-10-10 23:48:03,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:03,812 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:03,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:48:03,812 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:03,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1381349451, now seen corresponding path program 1 times [2024-10-10 23:48:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:03,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135089597] [2024-10-10 23:48:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:03,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-10 23:48:04,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:04,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135089597] [2024-10-10 23:48:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135089597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993645294] [2024-10-10 23:48:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:04,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:04,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:04,157 INFO L87 Difference]: Start difference. First operand 15897 states and 17879 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:05,709 INFO L93 Difference]: Finished difference Result 44147 states and 49783 transitions. [2024-10-10 23:48:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:05,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 379 [2024-10-10 23:48:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:05,754 INFO L225 Difference]: With dead ends: 44147 [2024-10-10 23:48:05,754 INFO L226 Difference]: Without dead ends: 28251 [2024-10-10 23:48:05,772 INFO L431 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 [2024-10-10 23:48:05,773 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 496 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:05,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 285 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28251 states. [2024-10-10 23:48:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28251 to 27808. [2024-10-10 23:48:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27808 states, 27807 states have (on average 1.1171647426906894) internal successors, (31065), 27807 states have internal predecessors, (31065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27808 states to 27808 states and 31065 transitions. [2024-10-10 23:48:06,123 INFO L78 Accepts]: Start accepts. Automaton has 27808 states and 31065 transitions. Word has length 379 [2024-10-10 23:48:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:06,124 INFO L471 AbstractCegarLoop]: Abstraction has 27808 states and 31065 transitions. [2024-10-10 23:48:06,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 27808 states and 31065 transitions. [2024-10-10 23:48:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-10-10 23:48:06,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:06,136 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:06,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:48:06,137 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:06,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash -293304718, now seen corresponding path program 1 times [2024-10-10 23:48:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604286294] [2024-10-10 23:48:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:48:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:06,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604286294] [2024-10-10 23:48:06,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604286294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:06,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:06,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:06,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138281979] [2024-10-10 23:48:06,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:06,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:06,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:06,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:06,676 INFO L87 Difference]: Start difference. First operand 27808 states and 31065 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:08,350 INFO L93 Difference]: Finished difference Result 62013 states and 69500 transitions. [2024-10-10 23:48:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:08,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 392 [2024-10-10 23:48:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:08,394 INFO L225 Difference]: With dead ends: 62013 [2024-10-10 23:48:08,395 INFO L226 Difference]: Without dead ends: 32501 [2024-10-10 23:48:08,412 INFO L431 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 [2024-10-10 23:48:08,413 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 465 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:08,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 839 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32501 states. [2024-10-10 23:48:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32501 to 32495. [2024-10-10 23:48:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32495 states, 32494 states have (on average 1.1129439281098048) internal successors, (36164), 32494 states have internal predecessors, (36164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32495 states to 32495 states and 36164 transitions. [2024-10-10 23:48:08,918 INFO L78 Accepts]: Start accepts. Automaton has 32495 states and 36164 transitions. Word has length 392 [2024-10-10 23:48:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:08,919 INFO L471 AbstractCegarLoop]: Abstraction has 32495 states and 36164 transitions. [2024-10-10 23:48:08,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 32495 states and 36164 transitions. [2024-10-10 23:48:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2024-10-10 23:48:08,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:08,934 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:08,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:48:08,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:08,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash 471280211, now seen corresponding path program 1 times [2024-10-10 23:48:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:08,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357835778] [2024-10-10 23:48:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:08,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:48:09,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:09,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357835778] [2024-10-10 23:48:09,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357835778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:09,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:09,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:09,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258014724] [2024-10-10 23:48:09,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:09,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:09,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:09,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:09,350 INFO L87 Difference]: Start difference. First operand 32495 states and 36164 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:11,084 INFO L93 Difference]: Finished difference Result 77800 states and 86692 transitions. [2024-10-10 23:48:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 441 [2024-10-10 23:48:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:11,155 INFO L225 Difference]: With dead ends: 77800 [2024-10-10 23:48:11,155 INFO L226 Difference]: Without dead ends: 45306 [2024-10-10 23:48:11,185 INFO L431 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 [2024-10-10 23:48:11,186 INFO L432 NwaCegarLoop]: 697 mSDtfsCounter, 497 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:11,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 751 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:48:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45306 states. [2024-10-10 23:48:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45306 to 43579. [2024-10-10 23:48:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43579 states, 43578 states have (on average 1.1083344807012714) internal successors, (48299), 43578 states have internal predecessors, (48299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43579 states to 43579 states and 48299 transitions. [2024-10-10 23:48:11,640 INFO L78 Accepts]: Start accepts. Automaton has 43579 states and 48299 transitions. Word has length 441 [2024-10-10 23:48:11,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:11,641 INFO L471 AbstractCegarLoop]: Abstraction has 43579 states and 48299 transitions. [2024-10-10 23:48:11,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 43579 states and 48299 transitions. [2024-10-10 23:48:11,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2024-10-10 23:48:11,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:11,653 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:11,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:48:11,654 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:11,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash 728425863, now seen corresponding path program 1 times [2024-10-10 23:48:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844415854] [2024-10-10 23:48:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:12,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:12,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844415854] [2024-10-10 23:48:12,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844415854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:12,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:12,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:12,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295579303] [2024-10-10 23:48:12,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:12,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:12,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:12,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:12,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:12,304 INFO L87 Difference]: Start difference. First operand 43579 states and 48299 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:14,806 INFO L93 Difference]: Finished difference Result 107191 states and 118515 transitions. [2024-10-10 23:48:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:14,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 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 449 [2024-10-10 23:48:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:14,902 INFO L225 Difference]: With dead ends: 107191 [2024-10-10 23:48:14,903 INFO L226 Difference]: Without dead ends: 63613 [2024-10-10 23:48:14,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:14,935 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 666 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:14,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 187 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:48:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63613 states. [2024-10-10 23:48:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63613 to 58070. [2024-10-10 23:48:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58070 states, 58069 states have (on average 1.106890079043896) internal successors, (64276), 58069 states have internal predecessors, (64276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58070 states to 58070 states and 64276 transitions. [2024-10-10 23:48:15,807 INFO L78 Accepts]: Start accepts. Automaton has 58070 states and 64276 transitions. Word has length 449 [2024-10-10 23:48:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:15,808 INFO L471 AbstractCegarLoop]: Abstraction has 58070 states and 64276 transitions. [2024-10-10 23:48:15,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 58070 states and 64276 transitions. [2024-10-10 23:48:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-10-10 23:48:15,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:15,823 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:15,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:48:15,823 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:15,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1941157624, now seen corresponding path program 1 times [2024-10-10 23:48:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695201650] [2024-10-10 23:48:15,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-10 23:48:16,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:16,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695201650] [2024-10-10 23:48:16,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695201650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:16,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835141542] [2024-10-10 23:48:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:16,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:16,476 INFO L87 Difference]: Start difference. First operand 58070 states and 64276 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:18,001 INFO L93 Difference]: Finished difference Result 116128 states and 128540 transitions. [2024-10-10 23:48:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:18,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 473 [2024-10-10 23:48:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:18,071 INFO L225 Difference]: With dead ends: 116128 [2024-10-10 23:48:18,072 INFO L226 Difference]: Without dead ends: 58059 [2024-10-10 23:48:18,111 INFO L431 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 [2024-10-10 23:48:18,112 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 495 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:18,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 740 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:48:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58059 states. [2024-10-10 23:48:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58059 to 57207. [2024-10-10 23:48:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57207 states, 57206 states have (on average 1.084868720064329) internal successors, (62061), 57206 states have internal predecessors, (62061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57207 states to 57207 states and 62061 transitions. [2024-10-10 23:48:18,978 INFO L78 Accepts]: Start accepts. Automaton has 57207 states and 62061 transitions. Word has length 473 [2024-10-10 23:48:18,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:18,979 INFO L471 AbstractCegarLoop]: Abstraction has 57207 states and 62061 transitions. [2024-10-10 23:48:18,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 57207 states and 62061 transitions. [2024-10-10 23:48:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2024-10-10 23:48:18,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:18,990 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:18,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:48:18,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:18,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1759022531, now seen corresponding path program 1 times [2024-10-10 23:48:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:18,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248511062] [2024-10-10 23:48:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:19,860 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:48:19,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:19,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248511062] [2024-10-10 23:48:19,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248511062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:19,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:19,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977681457] [2024-10-10 23:48:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:19,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:19,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:19,863 INFO L87 Difference]: Start difference. First operand 57207 states and 62061 transitions. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:21,606 INFO L93 Difference]: Finished difference Result 118262 states and 128436 transitions. [2024-10-10 23:48:21,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:21,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 492 [2024-10-10 23:48:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:21,683 INFO L225 Difference]: With dead ends: 118262 [2024-10-10 23:48:21,684 INFO L226 Difference]: Without dead ends: 60201 [2024-10-10 23:48:21,722 INFO L431 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 [2024-10-10 23:48:21,723 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 216 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:21,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 792 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:21,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60201 states. [2024-10-10 23:48:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60201 to 57208. [2024-10-10 23:48:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57208 states, 57207 states have (on average 1.0847273935007953) internal successors, (62054), 57207 states have internal predecessors, (62054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57208 states to 57208 states and 62054 transitions. [2024-10-10 23:48:22,657 INFO L78 Accepts]: Start accepts. Automaton has 57208 states and 62054 transitions. Word has length 492 [2024-10-10 23:48:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:22,657 INFO L471 AbstractCegarLoop]: Abstraction has 57208 states and 62054 transitions. [2024-10-10 23:48:22,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 57208 states and 62054 transitions. [2024-10-10 23:48:22,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-10-10 23:48:22,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:22,672 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:22,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:48:22,672 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:22,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash 527003963, now seen corresponding path program 1 times [2024-10-10 23:48:22,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:22,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030863717] [2024-10-10 23:48:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 23:48:23,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:23,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030863717] [2024-10-10 23:48:23,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030863717] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:48:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428481631] [2024-10-10 23:48:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:23,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:48:23,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:48:23,481 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:48:23,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:48:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:23,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:48:23,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:48:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 23:48:24,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:48:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 23:48:24,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428481631] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:48:24,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:48:24,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:48:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892958719] [2024-10-10 23:48:24,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:24,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:24,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:24,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:24,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:48:24,481 INFO L87 Difference]: Start difference. First operand 57208 states and 62054 transitions. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:27,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:27,523 INFO L93 Difference]: Finished difference Result 138297 states and 150078 transitions. [2024-10-10 23:48:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 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 505 [2024-10-10 23:48:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:27,639 INFO L225 Difference]: With dead ends: 138297 [2024-10-10 23:48:27,639 INFO L226 Difference]: Without dead ends: 79381 [2024-10-10 23:48:27,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1011 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:48:27,679 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 741 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:27,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 142 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-10 23:48:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79381 states. [2024-10-10 23:48:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79381 to 71667. [2024-10-10 23:48:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71667 states, 71666 states have (on average 1.0851728853291658) internal successors, (77770), 71666 states have internal predecessors, (77770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71667 states to 71667 states and 77770 transitions. [2024-10-10 23:48:28,669 INFO L78 Accepts]: Start accepts. Automaton has 71667 states and 77770 transitions. Word has length 505 [2024-10-10 23:48:28,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:28,669 INFO L471 AbstractCegarLoop]: Abstraction has 71667 states and 77770 transitions. [2024-10-10 23:48:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 71667 states and 77770 transitions. [2024-10-10 23:48:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2024-10-10 23:48:28,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:28,687 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:28,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:48:28,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:48:28,888 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:28,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash -543631024, now seen corresponding path program 1 times [2024-10-10 23:48:28,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:28,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567690422] [2024-10-10 23:48:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 277 proven. 82 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 23:48:29,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567690422] [2024-10-10 23:48:29,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567690422] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:48:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426374631] [2024-10-10 23:48:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:48:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:48:29,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:48:29,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:48:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:29,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:48:29,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:48:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 200 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:30,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:48:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:48:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426374631] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:48:31,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:48:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2024-10-10 23:48:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288857416] [2024-10-10 23:48:31,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:31,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:48:31,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:31,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:48:31,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:48:31,113 INFO L87 Difference]: Start difference. First operand 71667 states and 77770 transitions. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:34,502 INFO L93 Difference]: Finished difference Result 184222 states and 200278 transitions. [2024-10-10 23:48:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:48:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 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 530 [2024-10-10 23:48:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:34,640 INFO L225 Difference]: With dead ends: 184222 [2024-10-10 23:48:34,640 INFO L226 Difference]: Without dead ends: 109999 [2024-10-10 23:48:34,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 1055 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:48:34,692 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1240 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 3590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:34,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 184 Invalid, 3590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:48:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109999 states. [2024-10-10 23:48:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109999 to 85280. [2024-10-10 23:48:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85280 states, 85279 states have (on average 1.077768266513444) internal successors, (91911), 85279 states have internal predecessors, (91911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85280 states to 85280 states and 91911 transitions. [2024-10-10 23:48:36,055 INFO L78 Accepts]: Start accepts. Automaton has 85280 states and 91911 transitions. Word has length 530 [2024-10-10 23:48:36,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:36,055 INFO L471 AbstractCegarLoop]: Abstraction has 85280 states and 91911 transitions. [2024-10-10 23:48:36,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 85280 states and 91911 transitions. [2024-10-10 23:48:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2024-10-10 23:48:36,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:36,069 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:36,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:48:36,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 23:48:36,270 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:36,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash -593966466, now seen corresponding path program 1 times [2024-10-10 23:48:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:36,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290662121] [2024-10-10 23:48:36,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-10-10 23:48:36,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:36,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290662121] [2024-10-10 23:48:36,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290662121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:36,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:36,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:36,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959361344] [2024-10-10 23:48:36,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:36,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:36,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:36,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:36,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:36,454 INFO L87 Difference]: Start difference. First operand 85280 states and 91911 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:38,259 INFO L93 Difference]: Finished difference Result 175669 states and 189302 transitions. [2024-10-10 23:48:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:48:38,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 592 [2024-10-10 23:48:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:38,358 INFO L225 Difference]: With dead ends: 175669 [2024-10-10 23:48:38,358 INFO L226 Difference]: Without dead ends: 88687 [2024-10-10 23:48:38,410 INFO L431 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 [2024-10-10 23:48:38,410 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 504 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:38,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 673 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:48:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88687 states. [2024-10-10 23:48:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88687 to 84849. [2024-10-10 23:48:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84849 states, 84848 states have (on average 1.0682396756552894) internal successors, (90638), 84848 states have internal predecessors, (90638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84849 states to 84849 states and 90638 transitions. [2024-10-10 23:48:39,963 INFO L78 Accepts]: Start accepts. Automaton has 84849 states and 90638 transitions. Word has length 592 [2024-10-10 23:48:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 84849 states and 90638 transitions. [2024-10-10 23:48:39,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 84849 states and 90638 transitions. [2024-10-10 23:48:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2024-10-10 23:48:39,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:39,979 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:39,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:48:39,979 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:39,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:39,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1255622564, now seen corresponding path program 1 times [2024-10-10 23:48:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:39,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987690570] [2024-10-10 23:48:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:39,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 695 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-10 23:48:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987690570] [2024-10-10 23:48:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987690570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:40,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:40,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:40,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041621701] [2024-10-10 23:48:40,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:40,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:40,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:40,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:40,675 INFO L87 Difference]: Start difference. First operand 84849 states and 90638 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:43,382 INFO L93 Difference]: Finished difference Result 183319 states and 195676 transitions. [2024-10-10 23:48:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:43,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 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 635 [2024-10-10 23:48:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:43,498 INFO L225 Difference]: With dead ends: 183319 [2024-10-10 23:48:43,498 INFO L226 Difference]: Without dead ends: 98471 [2024-10-10 23:48:43,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:43,519 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 696 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:43,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 315 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:48:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98471 states. [2024-10-10 23:48:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98471 to 90794. [2024-10-10 23:48:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90794 states, 90793 states have (on average 1.0625488749132643) internal successors, (96472), 90793 states have internal predecessors, (96472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90794 states to 90794 states and 96472 transitions. [2024-10-10 23:48:44,781 INFO L78 Accepts]: Start accepts. Automaton has 90794 states and 96472 transitions. Word has length 635 [2024-10-10 23:48:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:44,782 INFO L471 AbstractCegarLoop]: Abstraction has 90794 states and 96472 transitions. [2024-10-10 23:48:44,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 90794 states and 96472 transitions. [2024-10-10 23:48:44,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2024-10-10 23:48:44,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:44,809 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:44,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:48:44,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash -116196281, now seen corresponding path program 1 times [2024-10-10 23:48:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308684791] [2024-10-10 23:48:44,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 707 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-10-10 23:48:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:45,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308684791] [2024-10-10 23:48:45,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308684791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:45,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:48:45,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657077175] [2024-10-10 23:48:45,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:48:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:48:45,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:45,612 INFO L87 Difference]: Start difference. First operand 90794 states and 96472 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:48,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:48:48,240 INFO L93 Difference]: Finished difference Result 187134 states and 198736 transitions. [2024-10-10 23:48:48,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:48:48,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 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 641 [2024-10-10 23:48:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:48:48,349 INFO L225 Difference]: With dead ends: 187134 [2024-10-10 23:48:48,350 INFO L226 Difference]: Without dead ends: 96341 [2024-10-10 23:48:48,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:48:48,373 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 692 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:48:48,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 764 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:48:48,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96341 states. [2024-10-10 23:48:49,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96341 to 91219. [2024-10-10 23:48:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91219 states, 91218 states have (on average 1.0624876669078471) internal successors, (96918), 91218 states have internal predecessors, (96918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91219 states to 91219 states and 96918 transitions. [2024-10-10 23:48:49,412 INFO L78 Accepts]: Start accepts. Automaton has 91219 states and 96918 transitions. Word has length 641 [2024-10-10 23:48:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:48:49,412 INFO L471 AbstractCegarLoop]: Abstraction has 91219 states and 96918 transitions. [2024-10-10 23:48:49,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:48:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 91219 states and 96918 transitions. [2024-10-10 23:48:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2024-10-10 23:48:49,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:48:49,433 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:48:49,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:48:49,433 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:48:49,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:48:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2059318088, now seen corresponding path program 1 times [2024-10-10 23:48:49,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:48:49,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408051411] [2024-10-10 23:48:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:48:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:48:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:48:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-10 23:48:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:48:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408051411] [2024-10-10 23:48:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408051411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:48:50,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:48:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:48:50,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83692541] [2024-10-10 23:48:50,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:48:50,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:48:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:48:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:48:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:48:50,151 INFO L87 Difference]: Start difference. First operand 91219 states and 96918 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)