./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 cd7d66127097bee693df60b26ad836789e8e18ef088953d4d01590e6c82035a4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:51:39,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:51:39,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:51:39,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:51:39,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:51:39,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:51:39,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:51:39,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:51:39,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:51:39,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:51:39,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:51:39,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:51:39,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:51:39,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:51:39,688 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:51:39,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:51:39,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:51:39,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:51:39,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:51:39,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:51:39,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:51:39,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:51:39,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:51:39,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:51:39,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:51:39,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:51:39,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:51:39,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:51:39,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:51:39,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:51:39,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:51:39,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:51:39,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:39,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:51:39,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:51:39,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:51:39,699 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:51:39,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:51:39,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:51:39,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:51:39,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:51:39,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:51:39,700 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 -> cd7d66127097bee693df60b26ad836789e8e18ef088953d4d01590e6c82035a4 [2024-10-11 03:51:39,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:51:40,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:51:40,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:51:40,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:51:40,026 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:51:40,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:51:41,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:51:41,741 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:51:41,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:51:41,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/183ffa136/f7dcbeac6d9b4d879c94093309fb7e34/FLAGc68cf7006 [2024-10-11 03:51:41,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/183ffa136/f7dcbeac6d9b4d879c94093309fb7e34 [2024-10-11 03:51:41,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:51:41,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:51:41,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:41,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:51:41,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:51:41,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:41" (1/1) ... [2024-10-11 03:51:41,792 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4221cc8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:41, skipping insertion in model container [2024-10-11 03:51:41,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:51:41" (1/1) ... [2024-10-11 03:51:41,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:51:42,089 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/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7669,7682] [2024-10-11 03:51:42,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:42,153 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:51:42,221 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/seq-mthreaded-reduced/pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7669,7682] [2024-10-11 03:51:42,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:51:42,276 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:51:42,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42 WrapperNode [2024-10-11 03:51:42,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:51:42,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:42,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:51:42,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:51:42,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,338 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 625 [2024-10-11 03:51:42,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:51:42,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:51:42,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:51:42,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:51:42,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,379 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-11 03:51:42,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:51:42,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:51:42,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:51:42,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:51:42,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (1/1) ... [2024-10-11 03:51:42,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:51:42,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:51:42,445 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-11 03:51:42,452 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-11 03:51:42,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:51:42,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:51:42,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:51:42,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:51:42,661 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:51:42,663 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:51:43,244 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-10-11 03:51:43,246 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:51:43,297 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:51:43,298 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:51:43,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:43 BoogieIcfgContainer [2024-10-11 03:51:43,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:51:43,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:51:43,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:51:43,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:51:43,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:51:41" (1/3) ... [2024-10-11 03:51:43,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ae444b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:43, skipping insertion in model container [2024-10-11 03:51:43,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:51:42" (2/3) ... [2024-10-11 03:51:43,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ae444b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:51:43, skipping insertion in model container [2024-10-11 03:51:43,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:51:43" (3/3) ... [2024-10-11 03:51:43,311 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-10-11 03:51:43,327 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:51:43,327 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:51:43,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:51:43,404 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;@b187aa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:51:43,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:51:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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-11 03:51:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:51:43,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:43,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:43,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:43,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:43,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1650403791, now seen corresponding path program 1 times [2024-10-11 03:51:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:43,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737951009] [2024-10-11 03:51:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:43,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:43,977 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-11 03:51:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737951009] [2024-10-11 03:51:43,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737951009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:43,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:43,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:51:43,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144219010] [2024-10-11 03:51:43,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:43,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:51:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:44,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:51:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:51:44,017 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7537313432835822) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-11 03:51:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:44,102 INFO L93 Difference]: Finished difference Result 296 states and 486 transitions. [2024-10-11 03:51:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:51:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-11 03:51:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:44,120 INFO L225 Difference]: With dead ends: 296 [2024-10-11 03:51:44,120 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 03:51:44,124 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-11 03:51:44,129 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 158 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:44,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 463 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 03:51:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2024-10-11 03:51:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.448780487804878) internal successors, (297), 205 states have internal predecessors, (297), 0 states have call successors, (0), 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-11 03:51:44,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 297 transitions. [2024-10-11 03:51:44,197 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 297 transitions. Word has length 86 [2024-10-11 03:51:44,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:44,198 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 297 transitions. [2024-10-11 03:51:44,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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-11 03:51:44,199 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 297 transitions. [2024-10-11 03:51:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 03:51:44,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:44,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:51:44,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash 890764243, now seen corresponding path program 1 times [2024-10-11 03:51:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:44,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959523804] [2024-10-11 03:51:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:44,403 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-11 03:51:44,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:44,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959523804] [2024-10-11 03:51:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959523804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:44,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:44,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:51:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558550571] [2024-10-11 03:51:44,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:44,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:51:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:51:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:51:44,410 INFO L87 Difference]: Start difference. First operand 206 states and 297 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 03:51:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:44,452 INFO L93 Difference]: Finished difference Result 498 states and 761 transitions. [2024-10-11 03:51:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:51:44,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-11 03:51:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:44,455 INFO L225 Difference]: With dead ends: 498 [2024-10-11 03:51:44,455 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 03:51:44,458 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-11 03:51:44,460 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 110 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:44,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 400 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 03:51:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2024-10-11 03:51:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 1.5043988269794721) internal successors, (513), 341 states have internal predecessors, (513), 0 states have call successors, (0), 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-11 03:51:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 513 transitions. [2024-10-11 03:51:44,495 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 513 transitions. Word has length 87 [2024-10-11 03:51:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:44,496 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 513 transitions. [2024-10-11 03:51:44,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 03:51:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 513 transitions. [2024-10-11 03:51:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:51:44,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:44,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:44,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:51:44,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:44,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:44,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1471057757, now seen corresponding path program 1 times [2024-10-11 03:51:44,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:44,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052717092] [2024-10-11 03:51:44,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:44,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:44,674 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-11 03:51:44,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:44,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052717092] [2024-10-11 03:51:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052717092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:51:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003229463] [2024-10-11 03:51:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:51:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:44,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:51:44,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:51:44,680 INFO L87 Difference]: Start difference. First operand 342 states and 513 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-11 03:51:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:44,708 INFO L93 Difference]: Finished difference Result 890 states and 1383 transitions. [2024-10-11 03:51:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:51:44,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-11 03:51:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:44,711 INFO L225 Difference]: With dead ends: 890 [2024-10-11 03:51:44,711 INFO L226 Difference]: Without dead ends: 600 [2024-10-11 03:51:44,716 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-11 03:51:44,718 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 105 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:44,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 396 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-11 03:51:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2024-10-11 03:51:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.5360134003350083) internal successors, (917), 597 states have internal predecessors, (917), 0 states have call successors, (0), 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-11 03:51:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 917 transitions. [2024-10-11 03:51:44,748 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 917 transitions. Word has length 88 [2024-10-11 03:51:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:44,748 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 917 transitions. [2024-10-11 03:51:44,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-11 03:51:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 917 transitions. [2024-10-11 03:51:44,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:51:44,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:44,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:44,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:51:44,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:44,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash 150999361, now seen corresponding path program 1 times [2024-10-11 03:51:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:44,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136622001] [2024-10-11 03:51:44,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:44,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:44,886 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-11 03:51:44,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:44,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136622001] [2024-10-11 03:51:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136622001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:44,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:51:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569199796] [2024-10-11 03:51:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:44,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:51:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:44,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:51:44,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:51:44,889 INFO L87 Difference]: Start difference. First operand 598 states and 917 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 03:51:44,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:44,916 INFO L93 Difference]: Finished difference Result 1626 states and 2543 transitions. [2024-10-11 03:51:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:51:44,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-11 03:51:44,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:44,921 INFO L225 Difference]: With dead ends: 1626 [2024-10-11 03:51:44,921 INFO L226 Difference]: Without dead ends: 1080 [2024-10-11 03:51:44,923 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-11 03:51:44,924 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 100 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:44,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 392 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-10-11 03:51:44,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2024-10-11 03:51:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.5496750232126277) internal successors, (1669), 1077 states have internal predecessors, (1669), 0 states have call successors, (0), 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-11 03:51:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1669 transitions. [2024-10-11 03:51:44,961 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1669 transitions. Word has length 89 [2024-10-11 03:51:44,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:44,962 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1669 transitions. [2024-10-11 03:51:44,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-11 03:51:44,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1669 transitions. [2024-10-11 03:51:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:51:44,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:44,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:44,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:51:44,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:44,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1554324511, now seen corresponding path program 1 times [2024-10-11 03:51:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563565660] [2024-10-11 03:51:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:45,097 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-11 03:51:45,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563565660] [2024-10-11 03:51:45,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563565660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:45,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:45,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:51:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129002847] [2024-10-11 03:51:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:45,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:51:45,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:51:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:51:45,100 INFO L87 Difference]: Start difference. First operand 1078 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 03:51:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:45,135 INFO L93 Difference]: Finished difference Result 3002 states and 4695 transitions. [2024-10-11 03:51:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:51:45,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-11 03:51:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:45,144 INFO L225 Difference]: With dead ends: 3002 [2024-10-11 03:51:45,144 INFO L226 Difference]: Without dead ends: 1976 [2024-10-11 03:51:45,146 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-11 03:51:45,148 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 95 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:45,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 388 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2024-10-11 03:51:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1974. [2024-10-11 03:51:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 1.5514445007602635) internal successors, (3061), 1973 states have internal predecessors, (3061), 0 states have call successors, (0), 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-11 03:51:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 3061 transitions. [2024-10-11 03:51:45,190 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 3061 transitions. Word has length 90 [2024-10-11 03:51:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:45,190 INFO L471 AbstractCegarLoop]: Abstraction has 1974 states and 3061 transitions. [2024-10-11 03:51:45,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-11 03:51:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 3061 transitions. [2024-10-11 03:51:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 03:51:45,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:45,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:51:45,194 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:45,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1995360903, now seen corresponding path program 1 times [2024-10-11 03:51:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:45,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219457689] [2024-10-11 03:51:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:45,343 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-11 03:51:45,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:45,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219457689] [2024-10-11 03:51:45,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219457689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:45,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:45,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:51:45,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349437676] [2024-10-11 03:51:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:45,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:51:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:45,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:51:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:51:45,346 INFO L87 Difference]: Start difference. First operand 1974 states and 3061 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-11 03:51:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:45,385 INFO L93 Difference]: Finished difference Result 5562 states and 8663 transitions. [2024-10-11 03:51:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:51:45,387 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 91 [2024-10-11 03:51:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:45,401 INFO L225 Difference]: With dead ends: 5562 [2024-10-11 03:51:45,402 INFO L226 Difference]: Without dead ends: 3640 [2024-10-11 03:51:45,406 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-11 03:51:45,407 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:45,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 384 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2024-10-11 03:51:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 3638. [2024-10-11 03:51:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3638 states, 3637 states have (on average 1.5455045367060765) internal successors, (5621), 3637 states have internal predecessors, (5621), 0 states have call successors, (0), 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-11 03:51:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 5621 transitions. [2024-10-11 03:51:45,495 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 5621 transitions. Word has length 91 [2024-10-11 03:51:45,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:45,498 INFO L471 AbstractCegarLoop]: Abstraction has 3638 states and 5621 transitions. [2024-10-11 03:51:45,498 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-11 03:51:45,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 5621 transitions. [2024-10-11 03:51:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:51:45,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:45,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:45,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:51:45,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:45,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:45,500 INFO L85 PathProgramCache]: Analyzing trace with hash 338584792, now seen corresponding path program 1 times [2024-10-11 03:51:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:45,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230982434] [2024-10-11 03:51:45,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:45,817 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-11 03:51:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230982434] [2024-10-11 03:51:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230982434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:45,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:45,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:51:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081330865] [2024-10-11 03:51:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:45,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:51:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:45,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:51:45,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:51:45,820 INFO L87 Difference]: Start difference. First operand 3638 states and 5621 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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-11 03:51:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:46,590 INFO L93 Difference]: Finished difference Result 53842 states and 83587 transitions. [2024-10-11 03:51:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:51:46,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:51:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:46,744 INFO L225 Difference]: With dead ends: 53842 [2024-10-11 03:51:46,744 INFO L226 Difference]: Without dead ends: 50256 [2024-10-11 03:51:46,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:51:46,770 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 2518 mSDsluCounter, 4862 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:46,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 5039 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:51:46,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50256 states. [2024-10-11 03:51:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50256 to 7222. [2024-10-11 03:51:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7222 states, 7221 states have (on average 1.5317823016202743) internal successors, (11061), 7221 states have internal predecessors, (11061), 0 states have call successors, (0), 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-11 03:51:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 11061 transitions. [2024-10-11 03:51:47,398 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 11061 transitions. Word has length 92 [2024-10-11 03:51:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:47,398 INFO L471 AbstractCegarLoop]: Abstraction has 7222 states and 11061 transitions. [2024-10-11 03:51:47,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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-11 03:51:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 11061 transitions. [2024-10-11 03:51:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:47,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:47,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:47,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:51:47,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1959347564, now seen corresponding path program 1 times [2024-10-11 03:51:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:47,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063497201] [2024-10-11 03:51:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:47,504 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-11 03:51:47,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:47,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063497201] [2024-10-11 03:51:47,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063497201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:47,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:47,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:51:47,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528204392] [2024-10-11 03:51:47,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:47,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:51:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:47,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:51:47,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:51:47,509 INFO L87 Difference]: Start difference. First operand 7222 states and 11061 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:47,643 INFO L93 Difference]: Finished difference Result 20858 states and 31863 transitions. [2024-10-11 03:51:47,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:51:47,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:47,670 INFO L225 Difference]: With dead ends: 20858 [2024-10-11 03:51:47,670 INFO L226 Difference]: Without dead ends: 13688 [2024-10-11 03:51:47,679 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-11 03:51:47,682 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 80 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:47,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 302 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13688 states. [2024-10-11 03:51:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 13558. [2024-10-11 03:51:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13558 states, 13557 states have (on average 1.505126502913624) internal successors, (20405), 13557 states have internal predecessors, (20405), 0 states have call successors, (0), 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-11 03:51:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13558 states to 13558 states and 20405 transitions. [2024-10-11 03:51:47,991 INFO L78 Accepts]: Start accepts. Automaton has 13558 states and 20405 transitions. Word has length 94 [2024-10-11 03:51:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:47,992 INFO L471 AbstractCegarLoop]: Abstraction has 13558 states and 20405 transitions. [2024-10-11 03:51:47,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:47,992 INFO L276 IsEmpty]: Start isEmpty. Operand 13558 states and 20405 transitions. [2024-10-11 03:51:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:51:47,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:47,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:47,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:51:47,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:47,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:47,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1938344909, now seen corresponding path program 1 times [2024-10-11 03:51:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:47,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493408082] [2024-10-11 03:51:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:48,579 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-11 03:51:48,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:48,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493408082] [2024-10-11 03:51:48,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493408082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:48,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:48,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:51:48,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775103249] [2024-10-11 03:51:48,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:48,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:51:48,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:51:48,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:51:48,583 INFO L87 Difference]: Start difference. First operand 13558 states and 20405 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:49,097 INFO L93 Difference]: Finished difference Result 27066 states and 40759 transitions. [2024-10-11 03:51:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:51:49,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:51:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:49,188 INFO L225 Difference]: With dead ends: 27066 [2024-10-11 03:51:49,188 INFO L226 Difference]: Without dead ends: 13560 [2024-10-11 03:51:49,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:51:49,204 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 634 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:49,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 987 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:51:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13560 states. [2024-10-11 03:51:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13560 to 13558. [2024-10-11 03:51:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13558 states, 13557 states have (on average 1.4956848860367338) internal successors, (20277), 13557 states have internal predecessors, (20277), 0 states have call successors, (0), 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-11 03:51:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13558 states to 13558 states and 20277 transitions. [2024-10-11 03:51:49,402 INFO L78 Accepts]: Start accepts. Automaton has 13558 states and 20277 transitions. Word has length 94 [2024-10-11 03:51:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:49,403 INFO L471 AbstractCegarLoop]: Abstraction has 13558 states and 20277 transitions. [2024-10-11 03:51:49,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13558 states and 20277 transitions. [2024-10-11 03:51:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:51:49,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:49,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:49,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:51:49,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:49,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1796384236, now seen corresponding path program 1 times [2024-10-11 03:51:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:49,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707701101] [2024-10-11 03:51:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:49,482 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-11 03:51:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707701101] [2024-10-11 03:51:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707701101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:49,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:51:49,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389312938] [2024-10-11 03:51:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:49,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:51:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:49,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:51:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:51:49,484 INFO L87 Difference]: Start difference. First operand 13558 states and 20277 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:49,576 INFO L93 Difference]: Finished difference Result 26621 states and 40123 transitions. [2024-10-11 03:51:49,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:51:49,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:49,618 INFO L225 Difference]: With dead ends: 26621 [2024-10-11 03:51:49,619 INFO L226 Difference]: Without dead ends: 19450 [2024-10-11 03:51:49,744 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-11 03:51:49,744 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 117 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:49,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 412 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19450 states. [2024-10-11 03:51:49,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19450 to 19448. [2024-10-11 03:51:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19448 states, 19447 states have (on average 1.4936494060780583) internal successors, (29047), 19447 states have internal predecessors, (29047), 0 states have call successors, (0), 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-11 03:51:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19448 states to 19448 states and 29047 transitions. [2024-10-11 03:51:50,000 INFO L78 Accepts]: Start accepts. Automaton has 19448 states and 29047 transitions. Word has length 95 [2024-10-11 03:51:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:50,000 INFO L471 AbstractCegarLoop]: Abstraction has 19448 states and 29047 transitions. [2024-10-11 03:51:50,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19448 states and 29047 transitions. [2024-10-11 03:51:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:51:50,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:50,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:50,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:51:50,002 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:50,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:50,002 INFO L85 PathProgramCache]: Analyzing trace with hash 38940696, now seen corresponding path program 1 times [2024-10-11 03:51:50,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:50,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737613151] [2024-10-11 03:51:50,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:50,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:50,136 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-11 03:51:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737613151] [2024-10-11 03:51:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737613151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:50,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924002687] [2024-10-11 03:51:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:50,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:50,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:50,139 INFO L87 Difference]: Start difference. First operand 19448 states and 29047 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:50,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:50,582 INFO L93 Difference]: Finished difference Result 51900 states and 77753 transitions. [2024-10-11 03:51:50,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:50,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:50,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:50,646 INFO L225 Difference]: With dead ends: 51900 [2024-10-11 03:51:50,646 INFO L226 Difference]: Without dead ends: 32506 [2024-10-11 03:51:50,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:50,673 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 741 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:50,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 185 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:51:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32506 states. [2024-10-11 03:51:51,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32506 to 32504. [2024-10-11 03:51:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32504 states, 32503 states have (on average 1.492262252715134) internal successors, (48503), 32503 states have internal predecessors, (48503), 0 states have call successors, (0), 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-11 03:51:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32504 states to 32504 states and 48503 transitions. [2024-10-11 03:51:51,328 INFO L78 Accepts]: Start accepts. Automaton has 32504 states and 48503 transitions. Word has length 95 [2024-10-11 03:51:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:51,329 INFO L471 AbstractCegarLoop]: Abstraction has 32504 states and 48503 transitions. [2024-10-11 03:51:51,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 32504 states and 48503 transitions. [2024-10-11 03:51:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:51:51,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:51,330 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:51,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:51:51,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:51,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -323178029, now seen corresponding path program 1 times [2024-10-11 03:51:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:51,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459714512] [2024-10-11 03:51:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:51,651 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-11 03:51:51,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:51,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459714512] [2024-10-11 03:51:51,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459714512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:51,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:51,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359067534] [2024-10-11 03:51:51,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:51,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:51,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:51,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:51,653 INFO L87 Difference]: Start difference. First operand 32504 states and 48503 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:51,915 INFO L93 Difference]: Finished difference Result 64954 states and 96952 transitions. [2024-10-11 03:51:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:52,116 INFO L225 Difference]: With dead ends: 64954 [2024-10-11 03:51:52,124 INFO L226 Difference]: Without dead ends: 32504 [2024-10-11 03:51:52,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:52,178 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 417 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:52,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 156 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:51:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32504 states. [2024-10-11 03:51:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32504 to 32504. [2024-10-11 03:51:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32504 states, 32503 states have (on average 1.4824170076608314) internal successors, (48183), 32503 states have internal predecessors, (48183), 0 states have call successors, (0), 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-11 03:51:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32504 states to 32504 states and 48183 transitions. [2024-10-11 03:51:52,704 INFO L78 Accepts]: Start accepts. Automaton has 32504 states and 48183 transitions. Word has length 95 [2024-10-11 03:51:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:52,704 INFO L471 AbstractCegarLoop]: Abstraction has 32504 states and 48183 transitions. [2024-10-11 03:51:52,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 32504 states and 48183 transitions. [2024-10-11 03:51:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:51:52,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:52,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:52,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:51:52,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:52,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:52,706 INFO L85 PathProgramCache]: Analyzing trace with hash 542354360, now seen corresponding path program 1 times [2024-10-11 03:51:52,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:52,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597749688] [2024-10-11 03:51:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:53,006 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-11 03:51:53,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:53,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597749688] [2024-10-11 03:51:53,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597749688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:53,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:53,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:53,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300747866] [2024-10-11 03:51:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:53,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:53,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:53,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:53,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:53,009 INFO L87 Difference]: Start difference. First operand 32504 states and 48183 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:53,317 INFO L93 Difference]: Finished difference Result 64954 states and 96312 transitions. [2024-10-11 03:51:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:53,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:53,375 INFO L225 Difference]: With dead ends: 64954 [2024-10-11 03:51:53,375 INFO L226 Difference]: Without dead ends: 32504 [2024-10-11 03:51:53,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:53,415 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 401 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:53,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 164 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:51:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32504 states. [2024-10-11 03:51:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32504 to 32504. [2024-10-11 03:51:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32504 states, 32503 states have (on average 1.4725717626065287) internal successors, (47863), 32503 states have internal predecessors, (47863), 0 states have call successors, (0), 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-11 03:51:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32504 states to 32504 states and 47863 transitions. [2024-10-11 03:51:54,117 INFO L78 Accepts]: Start accepts. Automaton has 32504 states and 47863 transitions. Word has length 95 [2024-10-11 03:51:54,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:54,117 INFO L471 AbstractCegarLoop]: Abstraction has 32504 states and 47863 transitions. [2024-10-11 03:51:54,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32504 states and 47863 transitions. [2024-10-11 03:51:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:51:54,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:54,118 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:54,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:51:54,119 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:54,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:54,120 INFO L85 PathProgramCache]: Analyzing trace with hash 13063859, now seen corresponding path program 1 times [2024-10-11 03:51:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715673395] [2024-10-11 03:51:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:54,283 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-11 03:51:54,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:54,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715673395] [2024-10-11 03:51:54,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715673395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:54,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:54,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:54,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215263811] [2024-10-11 03:51:54,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:54,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:54,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:54,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:54,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:54,285 INFO L87 Difference]: Start difference. First operand 32504 states and 47863 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:54,676 INFO L93 Difference]: Finished difference Result 64954 states and 95672 transitions. [2024-10-11 03:51:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:54,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:54,726 INFO L225 Difference]: With dead ends: 64954 [2024-10-11 03:51:54,726 INFO L226 Difference]: Without dead ends: 32504 [2024-10-11 03:51:54,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:54,755 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 437 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:54,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 140 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:51:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32504 states. [2024-10-11 03:51:55,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32504 to 32504. [2024-10-11 03:51:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32504 states, 32503 states have (on average 1.462726517552226) internal successors, (47543), 32503 states have internal predecessors, (47543), 0 states have call successors, (0), 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-11 03:51:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32504 states to 32504 states and 47543 transitions. [2024-10-11 03:51:55,439 INFO L78 Accepts]: Start accepts. Automaton has 32504 states and 47543 transitions. Word has length 95 [2024-10-11 03:51:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:55,439 INFO L471 AbstractCegarLoop]: Abstraction has 32504 states and 47543 transitions. [2024-10-11 03:51:55,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 32504 states and 47543 transitions. [2024-10-11 03:51:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:51:55,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:55,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:55,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:51:55,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:55,442 INFO L85 PathProgramCache]: Analyzing trace with hash -749799848, now seen corresponding path program 1 times [2024-10-11 03:51:55,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:55,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701592320] [2024-10-11 03:51:55,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:55,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:55,575 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-11 03:51:55,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701592320] [2024-10-11 03:51:55,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701592320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:55,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:55,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:51:55,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686166198] [2024-10-11 03:51:55,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:55,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:55,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:55,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:55,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:55,578 INFO L87 Difference]: Start difference. First operand 32504 states and 47543 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:55,835 INFO L93 Difference]: Finished difference Result 64954 states and 95032 transitions. [2024-10-11 03:51:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:56,136 INFO L225 Difference]: With dead ends: 64954 [2024-10-11 03:51:56,141 INFO L226 Difference]: Without dead ends: 32504 [2024-10-11 03:51:56,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:51:56,210 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 460 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:56,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 124 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:51:56,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32504 states. [2024-10-11 03:51:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32504 to 32504. [2024-10-11 03:51:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32504 states, 32503 states have (on average 1.4528812724979232) internal successors, (47223), 32503 states have internal predecessors, (47223), 0 states have call successors, (0), 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-11 03:51:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32504 states to 32504 states and 47223 transitions. [2024-10-11 03:51:56,646 INFO L78 Accepts]: Start accepts. Automaton has 32504 states and 47223 transitions. Word has length 95 [2024-10-11 03:51:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:56,646 INFO L471 AbstractCegarLoop]: Abstraction has 32504 states and 47223 transitions. [2024-10-11 03:51:56,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 32504 states and 47223 transitions. [2024-10-11 03:51:56,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:51:56,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:56,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:56,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:51:56,648 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:56,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1803750333, now seen corresponding path program 1 times [2024-10-11 03:51:56,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:56,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506451946] [2024-10-11 03:51:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:56,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:57,174 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-11 03:51:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506451946] [2024-10-11 03:51:57,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506451946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:57,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 03:51:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528503722] [2024-10-11 03:51:57,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:57,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:51:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:51:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:57,178 INFO L87 Difference]: Start difference. First operand 32504 states and 47223 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:57,285 INFO L93 Difference]: Finished difference Result 33530 states and 48760 transitions. [2024-10-11 03:51:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:51:57,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:57,333 INFO L225 Difference]: With dead ends: 33530 [2024-10-11 03:51:57,333 INFO L226 Difference]: Without dead ends: 33528 [2024-10-11 03:51:57,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:51:57,349 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:57,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 688 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:51:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33528 states. [2024-10-11 03:51:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33528 to 33528. [2024-10-11 03:51:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33528 states, 33527 states have (on average 1.4371402153488233) internal successors, (48183), 33527 states have internal predecessors, (48183), 0 states have call successors, (0), 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-11 03:51:57,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33528 states to 33528 states and 48183 transitions. [2024-10-11 03:51:57,855 INFO L78 Accepts]: Start accepts. Automaton has 33528 states and 48183 transitions. Word has length 95 [2024-10-11 03:51:57,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:57,856 INFO L471 AbstractCegarLoop]: Abstraction has 33528 states and 48183 transitions. [2024-10-11 03:51:57,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 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-11 03:51:57,856 INFO L276 IsEmpty]: Start isEmpty. Operand 33528 states and 48183 transitions. [2024-10-11 03:51:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 03:51:57,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:57,867 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:57,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:51:57,867 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:51:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1984394937, now seen corresponding path program 1 times [2024-10-11 03:51:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:57,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616880898] [2024-10-11 03:51:57,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 03:51:58,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:58,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616880898] [2024-10-11 03:51:58,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616880898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:58,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:58,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:51:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087273680] [2024-10-11 03:51:58,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:58,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:51:58,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:58,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:51:58,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:51:58,131 INFO L87 Difference]: Start difference. First operand 33528 states and 48183 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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-11 03:51:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:59,201 INFO L93 Difference]: Finished difference Result 278280 states and 399871 transitions. [2024-10-11 03:51:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:51:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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 130 [2024-10-11 03:51:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:59,555 INFO L225 Difference]: With dead ends: 278280 [2024-10-11 03:51:59,555 INFO L226 Difference]: Without dead ends: 244806 [2024-10-11 03:51:59,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:51:59,662 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 2154 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:59,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 1909 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:51:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244806 states. [2024-10-11 03:52:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244806 to 67000. [2024-10-11 03:52:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67000 states, 66999 states have (on average 1.4327228764608426) internal successors, (95991), 66999 states have internal predecessors, (95991), 0 states have call successors, (0), 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-11 03:52:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67000 states to 67000 states and 95991 transitions. [2024-10-11 03:52:01,945 INFO L78 Accepts]: Start accepts. Automaton has 67000 states and 95991 transitions. Word has length 130 [2024-10-11 03:52:01,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:01,946 INFO L471 AbstractCegarLoop]: Abstraction has 67000 states and 95991 transitions. [2024-10-11 03:52:01,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 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-11 03:52:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 67000 states and 95991 transitions. [2024-10-11 03:52:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 03:52:01,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:01,960 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:01,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:52:01,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:52:01,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:01,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1659771213, now seen corresponding path program 1 times [2024-10-11 03:52:01,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:01,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700669147] [2024-10-11 03:52:01,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:01,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 03:52:02,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:02,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700669147] [2024-10-11 03:52:02,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700669147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:02,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:02,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:52:02,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461323471] [2024-10-11 03:52:02,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:02,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:52:02,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:02,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:52:02,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:52:02,195 INFO L87 Difference]: Start difference. First operand 67000 states and 95991 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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-11 03:52:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:03,328 INFO L93 Difference]: Finished difference Result 311752 states and 447679 transitions. [2024-10-11 03:52:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:52:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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 130 [2024-10-11 03:52:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:03,756 INFO L225 Difference]: With dead ends: 311752 [2024-10-11 03:52:03,756 INFO L226 Difference]: Without dead ends: 278278 [2024-10-11 03:52:03,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:03,853 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 2277 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:03,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 1716 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:52:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278278 states. [2024-10-11 03:52:06,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278278 to 117240. [2024-10-11 03:52:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117240 states, 117239 states have (on average 1.4279804501914892) internal successors, (167415), 117239 states have internal predecessors, (167415), 0 states have call successors, (0), 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-11 03:52:06,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117240 states to 117240 states and 167415 transitions. [2024-10-11 03:52:06,784 INFO L78 Accepts]: Start accepts. Automaton has 117240 states and 167415 transitions. Word has length 130 [2024-10-11 03:52:06,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:06,785 INFO L471 AbstractCegarLoop]: Abstraction has 117240 states and 167415 transitions. [2024-10-11 03:52:06,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 9 states have internal predecessors, (123), 0 states have call successors, (0), 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-11 03:52:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 117240 states and 167415 transitions. [2024-10-11 03:52:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 03:52:06,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:06,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:06,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:52:06,801 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:52:06,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:06,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2040208283, now seen corresponding path program 1 times [2024-10-11 03:52:06,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:06,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740226450] [2024-10-11 03:52:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 03:52:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740226450] [2024-10-11 03:52:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740226450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:52:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802972027] [2024-10-11 03:52:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:07,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:52:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:52:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:52:07,613 INFO L87 Difference]: Start difference. First operand 117240 states and 167415 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 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-11 03:52:08,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:08,516 INFO L93 Difference]: Finished difference Result 345224 states and 495487 transitions. [2024-10-11 03:52:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:52:08,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 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 130 [2024-10-11 03:52:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:09,631 INFO L225 Difference]: With dead ends: 345224 [2024-10-11 03:52:09,631 INFO L226 Difference]: Without dead ends: 311750 [2024-10-11 03:52:09,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:09,728 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 2143 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:09,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2143 Valid, 1915 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:52:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311750 states. [2024-10-11 03:52:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311750 to 150712. [2024-10-11 03:52:12,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150712 states, 150711 states have (on average 1.428051038079503) internal successors, (215223), 150711 states have internal predecessors, (215223), 0 states have call successors, (0), 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-11 03:52:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150712 states to 150712 states and 215223 transitions. [2024-10-11 03:52:12,949 INFO L78 Accepts]: Start accepts. Automaton has 150712 states and 215223 transitions. Word has length 130 [2024-10-11 03:52:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:12,949 INFO L471 AbstractCegarLoop]: Abstraction has 150712 states and 215223 transitions. [2024-10-11 03:52:12,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 0 states have call successors, (0), 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-11 03:52:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 150712 states and 215223 transitions. [2024-10-11 03:52:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 03:52:12,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:12,962 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:12,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:52:12,963 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:52:12,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash -886262177, now seen corresponding path program 1 times [2024-10-11 03:52:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962437855] [2024-10-11 03:52:12,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:12,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 03:52:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:13,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962437855] [2024-10-11 03:52:13,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962437855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:13,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:13,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:52:13,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059629143] [2024-10-11 03:52:13,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:13,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:52:13,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:13,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:52:13,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:52:13,193 INFO L87 Difference]: Start difference. First operand 150712 states and 215223 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 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-11 03:52:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:14,960 INFO L93 Difference]: Finished difference Result 378696 states and 543295 transitions. [2024-10-11 03:52:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:52:14,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 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 130 [2024-10-11 03:52:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:15,483 INFO L225 Difference]: With dead ends: 378696 [2024-10-11 03:52:15,483 INFO L226 Difference]: Without dead ends: 345222 [2024-10-11 03:52:15,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:15,576 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1878 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:15,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 1983 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:52:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345222 states. [2024-10-11 03:52:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345222 to 184184. [2024-10-11 03:52:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184184 states, 184183 states have (on average 1.4280959697691968) internal successors, (263031), 184183 states have internal predecessors, (263031), 0 states have call successors, (0), 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-11 03:52:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184184 states to 184184 states and 263031 transitions. [2024-10-11 03:52:20,264 INFO L78 Accepts]: Start accepts. Automaton has 184184 states and 263031 transitions. Word has length 130 [2024-10-11 03:52:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:20,264 INFO L471 AbstractCegarLoop]: Abstraction has 184184 states and 263031 transitions. [2024-10-11 03:52:20,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 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-11 03:52:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 184184 states and 263031 transitions. [2024-10-11 03:52:20,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 03:52:20,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:20,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:20,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:52:20,276 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:52:20,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:20,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1744162855, now seen corresponding path program 1 times [2024-10-11 03:52:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:20,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009274069] [2024-10-11 03:52:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:52:20,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:20,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009274069] [2024-10-11 03:52:20,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009274069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:52:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945233338] [2024-10-11 03:52:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:20,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:52:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:20,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:52:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:52:20,522 INFO L87 Difference]: Start difference. First operand 184184 states and 263031 transitions. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 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-11 03:52:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:22,453 INFO L93 Difference]: Finished difference Result 412168 states and 591103 transitions. [2024-10-11 03:52:22,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:52:22,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 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 130 [2024-10-11 03:52:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:23,056 INFO L225 Difference]: With dead ends: 412168 [2024-10-11 03:52:23,056 INFO L226 Difference]: Without dead ends: 378694 [2024-10-11 03:52:23,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:23,174 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1807 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:23,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2046 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:52:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378694 states. [2024-10-11 03:52:27,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378694 to 217656. [2024-10-11 03:52:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217656 states, 217655 states have (on average 1.4281270818497163) internal successors, (310839), 217655 states have internal predecessors, (310839), 0 states have call successors, (0), 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-11 03:52:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217656 states to 217656 states and 310839 transitions. [2024-10-11 03:52:28,042 INFO L78 Accepts]: Start accepts. Automaton has 217656 states and 310839 transitions. Word has length 130 [2024-10-11 03:52:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:28,042 INFO L471 AbstractCegarLoop]: Abstraction has 217656 states and 310839 transitions. [2024-10-11 03:52:28,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 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-11 03:52:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 217656 states and 310839 transitions. [2024-10-11 03:52:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 03:52:28,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:28,055 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:52:28,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:52:28,055 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:52:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash -315666221, now seen corresponding path program 1 times [2024-10-11 03:52:28,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:28,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450563123] [2024-10-11 03:52:28,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:28,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:52:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:52:28,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:52:28,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450563123] [2024-10-11 03:52:28,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450563123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:52:28,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:52:28,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:52:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854551619] [2024-10-11 03:52:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:52:28,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:52:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:52:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:52:28,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:52:28,271 INFO L87 Difference]: Start difference. First operand 217656 states and 310839 transitions. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 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-11 03:52:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:52:30,321 INFO L93 Difference]: Finished difference Result 445640 states and 638911 transitions. [2024-10-11 03:52:30,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:52:30,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 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 130 [2024-10-11 03:52:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:52:31,019 INFO L225 Difference]: With dead ends: 445640 [2024-10-11 03:52:31,020 INFO L226 Difference]: Without dead ends: 412166 [2024-10-11 03:52:31,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:52:31,154 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 1889 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:52:31,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 2156 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:52:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412166 states. [2024-10-11 03:52:35,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412166 to 251128. [2024-10-11 03:52:35,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251128 states, 251127 states have (on average 1.4281499002496745) internal successors, (358647), 251127 states have internal predecessors, (358647), 0 states have call successors, (0), 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-11 03:52:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251128 states to 251128 states and 358647 transitions. [2024-10-11 03:52:36,092 INFO L78 Accepts]: Start accepts. Automaton has 251128 states and 358647 transitions. Word has length 130 [2024-10-11 03:52:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:52:36,092 INFO L471 AbstractCegarLoop]: Abstraction has 251128 states and 358647 transitions. [2024-10-11 03:52:36,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 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-11 03:52:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 251128 states and 358647 transitions. [2024-10-11 03:52:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:52:36,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:52:36,107 INFO L215 NwaCegarLoop]: trace histogram [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-11 03:52:36,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:52:36,107 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:52:36,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:52:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1391691302, now seen corresponding path program 1 times [2024-10-11 03:52:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:52:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957631827] [2024-10-11 03:52:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:52:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:52:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat