./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.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 24c0edd0e5f96364946e218befc8d4e48724a125bbdaeb43992b42af0d599b66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:53:45,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:53:45,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:53:45,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:53:45,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:53:45,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:53:45,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:53:45,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:53:45,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:53:45,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:53:45,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:53:45,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:53:45,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:53:45,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:53:45,480 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:53:45,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:53:45,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:53:45,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:53:45,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:53:45,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:53:45,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:53:45,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:53:45,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:53:45,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:53:45,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:53:45,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:53:45,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:53:45,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:53:45,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:53:45,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:53:45,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:53:45,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:53:45,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:53:45,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:53:45,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:53:45,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:53:45,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:53:45,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:53:45,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:53:45,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:53:45,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:53:45,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:53:45,486 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 -> 24c0edd0e5f96364946e218befc8d4e48724a125bbdaeb43992b42af0d599b66 [2024-10-11 04:53:45,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:53:45,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:53:45,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:53:45,724 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:53:45,725 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:53:45,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:53:46,922 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:53:47,285 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:53:47,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:53:47,319 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d4236d021/5f35cb660e5448f78b7ef9fdaba4a1cf/FLAGb24ae74d4 [2024-10-11 04:53:47,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d4236d021/5f35cb660e5448f78b7ef9fdaba4a1cf [2024-10-11 04:53:47,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:53:47,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:53:47,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:53:47,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:53:47,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:53:47,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:53:47" (1/1) ... [2024-10-11 04:53:47,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4850321d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:47, skipping insertion in model container [2024-10-11 04:53:47,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:53:47" (1/1) ... [2024-10-11 04:53:47,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:53:47,834 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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[15584,15597] [2024-10-11 04:53:47,861 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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[21139,21152] [2024-10-11 04:53:48,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:53:48,362 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:53:48,392 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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[15584,15597] [2024-10-11 04:53:48,398 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/combinations/pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c[21139,21152] [2024-10-11 04:53:48,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:53:48,702 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:53:48,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48 WrapperNode [2024-10-11 04:53:48,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:53:48,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:53:48,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:53:48,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:53:48,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:48,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:48,985 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5155 [2024-10-11 04:53:48,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:53:48,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:53:48,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:53:48,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:53:49,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,162 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 04:53:49,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:53:49,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:53:49,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:53:49,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:53:49,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (1/1) ... [2024-10-11 04:53:49,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:53:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:53:49,528 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 04:53:49,530 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 04:53:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:53:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:53:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:53:49,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:53:49,673 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:53:49,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:53:52,824 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2024-10-11 04:53:52,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:53:52,871 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:53:52,872 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 04:53:52,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:53:52 BoogieIcfgContainer [2024-10-11 04:53:52,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:53:52,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:53:52,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:53:52,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:53:52,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:53:47" (1/3) ... [2024-10-11 04:53:52,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b2bfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:53:52, skipping insertion in model container [2024-10-11 04:53:52,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:53:48" (2/3) ... [2024-10-11 04:53:52,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b2bfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:53:52, skipping insertion in model container [2024-10-11 04:53:52,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:53:52" (3/3) ... [2024-10-11 04:53:52,882 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6_overflow.ufo.UNBOUNDED.pals+Problem12_label01.c [2024-10-11 04:53:52,894 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:53:52,895 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:53:52,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:53:52,972 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;@7eb074b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:53:52,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:53:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 849 states, 846 states have (on average 1.9739952718676124) internal successors, (1670), 848 states have internal predecessors, (1670), 0 states have call successors, (0), 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 04:53:52,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 04:53:52,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:52,985 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] [2024-10-11 04:53:52,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:52,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash -713532304, now seen corresponding path program 1 times [2024-10-11 04:53:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658032293] [2024-10-11 04:53:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:53,214 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 04:53:53,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658032293] [2024-10-11 04:53:53,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658032293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:53,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:53,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:53:53,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097155202] [2024-10-11 04:53:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:53,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 04:53:53,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:53,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 04:53:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:53:53,240 INFO L87 Difference]: Start difference. First operand has 849 states, 846 states have (on average 1.9739952718676124) internal successors, (1670), 848 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 04:53:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:53,317 INFO L93 Difference]: Finished difference Result 1653 states and 3253 transitions. [2024-10-11 04:53:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 04:53:53,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-11 04:53:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:53,339 INFO L225 Difference]: With dead ends: 1653 [2024-10-11 04:53:53,339 INFO L226 Difference]: Without dead ends: 845 [2024-10-11 04:53:53,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 04:53:53,345 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:53,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1598 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:53,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-11 04:53:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-10-11 04:53:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.896797153024911) internal successors, (1599), 844 states have internal predecessors, (1599), 0 states have call successors, (0), 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 04:53:53,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1599 transitions. [2024-10-11 04:53:53,406 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1599 transitions. Word has length 23 [2024-10-11 04:53:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:53,406 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1599 transitions. [2024-10-11 04:53:53,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 04:53:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1599 transitions. [2024-10-11 04:53:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 04:53:53,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:53,410 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] [2024-10-11 04:53:53,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:53:53,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:53,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1892491250, now seen corresponding path program 1 times [2024-10-11 04:53:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:53,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056569074] [2024-10-11 04:53:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:53,556 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 04:53:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:53,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056569074] [2024-10-11 04:53:53,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056569074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:53,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:53,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:53:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941418217] [2024-10-11 04:53:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:53:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:53,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:53:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:53,567 INFO L87 Difference]: Start difference. First operand 845 states and 1599 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 04:53:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:53,656 INFO L93 Difference]: Finished difference Result 895 states and 1678 transitions. [2024-10-11 04:53:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:53:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-10-11 04:53:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:53,661 INFO L225 Difference]: With dead ends: 895 [2024-10-11 04:53:53,662 INFO L226 Difference]: Without dead ends: 845 [2024-10-11 04:53:53,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:53,663 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 0 mSDsluCounter, 3148 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4744 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:53,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4744 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-11 04:53:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-10-11 04:53:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 1.849347568208778) internal successors, (1559), 844 states have internal predecessors, (1559), 0 states have call successors, (0), 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 04:53:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1559 transitions. [2024-10-11 04:53:53,682 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1559 transitions. Word has length 23 [2024-10-11 04:53:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:53,683 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1559 transitions. [2024-10-11 04:53:53,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 04:53:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1559 transitions. [2024-10-11 04:53:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 04:53:53,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:53,684 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] [2024-10-11 04:53:53,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:53:53,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:53,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash -308037014, now seen corresponding path program 1 times [2024-10-11 04:53:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:53,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281523577] [2024-10-11 04:53:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:53,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:53,775 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 04:53:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281523577] [2024-10-11 04:53:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281523577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:53,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 04:53:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300798167] [2024-10-11 04:53:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:53,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:53,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:53,782 INFO L87 Difference]: Start difference. First operand 845 states and 1559 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 04:53:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:56,319 INFO L93 Difference]: Finished difference Result 2349 states and 4432 transitions. [2024-10-11 04:53:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:56,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-11 04:53:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:56,325 INFO L225 Difference]: With dead ends: 2349 [2024-10-11 04:53:56,325 INFO L226 Difference]: Without dead ends: 1596 [2024-10-11 04:53:56,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:56,326 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 891 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:56,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 545 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 04:53:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2024-10-11 04:53:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2024-10-11 04:53:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1594 states have (on average 1.6223337515683813) internal successors, (2586), 1595 states have internal predecessors, (2586), 0 states have call successors, (0), 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 04:53:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2586 transitions. [2024-10-11 04:53:56,350 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2586 transitions. Word has length 47 [2024-10-11 04:53:56,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:56,353 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2586 transitions. [2024-10-11 04:53:56,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 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 04:53:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2586 transitions. [2024-10-11 04:53:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 04:53:56,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:56,356 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] [2024-10-11 04:53:56,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:53:56,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:56,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash -808348940, now seen corresponding path program 1 times [2024-10-11 04:53:56,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:56,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26164618] [2024-10-11 04:53:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:56,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:56,525 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 04:53:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26164618] [2024-10-11 04:53:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26164618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:56,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:56,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844681795] [2024-10-11 04:53:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:56,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:56,527 INFO L87 Difference]: Start difference. First operand 1596 states and 2586 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 04:53:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:56,792 INFO L93 Difference]: Finished difference Result 2160 states and 3498 transitions. [2024-10-11 04:53:56,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:53:56,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 04:53:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:56,800 INFO L225 Difference]: With dead ends: 2160 [2024-10-11 04:53:56,800 INFO L226 Difference]: Without dead ends: 2113 [2024-10-11 04:53:56,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:53:56,802 INFO L432 NwaCegarLoop]: 1552 mSDtfsCounter, 9675 mSDsluCounter, 2072 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9675 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:56,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9675 Valid, 3624 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:56,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2024-10-11 04:53:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1641. [2024-10-11 04:53:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1639 states have (on average 1.6223306894447833) internal successors, (2659), 1640 states have internal predecessors, (2659), 0 states have call successors, (0), 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 04:53:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2659 transitions. [2024-10-11 04:53:56,834 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2659 transitions. Word has length 62 [2024-10-11 04:53:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:56,836 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2659 transitions. [2024-10-11 04:53:56,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 04:53:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2659 transitions. [2024-10-11 04:53:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 04:53:56,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:56,841 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] [2024-10-11 04:53:56,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:53:56,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:56,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash 431995268, now seen corresponding path program 1 times [2024-10-11 04:53:56,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:56,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639270021] [2024-10-11 04:53:56,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:56,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:56,912 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 04:53:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639270021] [2024-10-11 04:53:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639270021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:56,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:56,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:56,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700181722] [2024-10-11 04:53:56,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:56,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:56,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:56,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:56,914 INFO L87 Difference]: Start difference. First operand 1641 states and 2659 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 04:53:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:56,943 INFO L93 Difference]: Finished difference Result 1814 states and 2938 transitions. [2024-10-11 04:53:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:56,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 04:53:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:56,950 INFO L225 Difference]: With dead ends: 1814 [2024-10-11 04:53:56,950 INFO L226 Difference]: Without dead ends: 1722 [2024-10-11 04:53:56,951 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 04:53:56,952 INFO L432 NwaCegarLoop]: 1554 mSDtfsCounter, 1488 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1624 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 04:53:56,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 1624 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2024-10-11 04:53:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2024-10-11 04:53:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.6210710128055879) internal successors, (2785), 1719 states have internal predecessors, (2785), 0 states have call successors, (0), 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 04:53:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2785 transitions. [2024-10-11 04:53:56,976 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2785 transitions. Word has length 64 [2024-10-11 04:53:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:56,977 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2785 transitions. [2024-10-11 04:53:56,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 04:53:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2785 transitions. [2024-10-11 04:53:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 04:53:56,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:56,980 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] [2024-10-11 04:53:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:53:56,981 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:56,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash 434140220, now seen corresponding path program 1 times [2024-10-11 04:53:56,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:56,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72220869] [2024-10-11 04:53:56,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:56,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:57,259 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 04:53:57,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:57,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72220869] [2024-10-11 04:53:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72220869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406079117] [2024-10-11 04:53:57,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:57,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:57,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:57,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:57,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:57,262 INFO L87 Difference]: Start difference. First operand 1720 states and 2785 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 04:53:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:57,453 INFO L93 Difference]: Finished difference Result 1893 states and 3061 transitions. [2024-10-11 04:53:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:57,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2024-10-11 04:53:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:57,459 INFO L225 Difference]: With dead ends: 1893 [2024-10-11 04:53:57,460 INFO L226 Difference]: Without dead ends: 1722 [2024-10-11 04:53:57,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:53:57,462 INFO L432 NwaCegarLoop]: 1548 mSDtfsCounter, 4510 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4510 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:57,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4510 Valid, 1906 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:57,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2024-10-11 04:53:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2024-10-11 04:53:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.619906868451688) internal successors, (2783), 1719 states have internal predecessors, (2783), 0 states have call successors, (0), 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 04:53:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2783 transitions. [2024-10-11 04:53:57,487 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2783 transitions. Word has length 64 [2024-10-11 04:53:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:57,487 INFO L471 AbstractCegarLoop]: Abstraction has 1720 states and 2783 transitions. [2024-10-11 04:53:57,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 04:53:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2783 transitions. [2024-10-11 04:53:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 04:53:57,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:57,488 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] [2024-10-11 04:53:57,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:53:57,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:57,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash 444744363, now seen corresponding path program 1 times [2024-10-11 04:53:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:57,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472776675] [2024-10-11 04:53:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:57,622 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 04:53:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472776675] [2024-10-11 04:53:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472776675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:57,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:57,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 04:53:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721417981] [2024-10-11 04:53:57,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:57,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 04:53:57,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:57,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 04:53:57,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:57,625 INFO L87 Difference]: Start difference. First operand 1720 states and 2783 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 04:53:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:57,654 INFO L93 Difference]: Finished difference Result 1726 states and 2790 transitions. [2024-10-11 04:53:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 04:53:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-11 04:53:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:57,660 INFO L225 Difference]: With dead ends: 1726 [2024-10-11 04:53:57,660 INFO L226 Difference]: Without dead ends: 1724 [2024-10-11 04:53:57,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 04:53:57,662 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 3102 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4657 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:57,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4657 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2024-10-11 04:53:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2024-10-11 04:53:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1722 states have (on average 1.6178861788617886) internal successors, (2786), 1723 states have internal predecessors, (2786), 0 states have call successors, (0), 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 04:53:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2786 transitions. [2024-10-11 04:53:57,686 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2786 transitions. Word has length 65 [2024-10-11 04:53:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:57,687 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 2786 transitions. [2024-10-11 04:53:57,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 04:53:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2786 transitions. [2024-10-11 04:53:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:57,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:57,688 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] [2024-10-11 04:53:57,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 04:53:57,689 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:57,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash 239452988, now seen corresponding path program 1 times [2024-10-11 04:53:57,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:57,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132852249] [2024-10-11 04:53:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:57,732 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 04:53:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132852249] [2024-10-11 04:53:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132852249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:57,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871898346] [2024-10-11 04:53:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:57,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:57,734 INFO L87 Difference]: Start difference. First operand 1724 states and 2786 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:57,764 INFO L93 Difference]: Finished difference Result 1910 states and 3079 transitions. [2024-10-11 04:53:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 04:53:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:57,770 INFO L225 Difference]: With dead ends: 1910 [2024-10-11 04:53:57,770 INFO L226 Difference]: Without dead ends: 1814 [2024-10-11 04:53:57,770 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 04:53:57,771 INFO L432 NwaCegarLoop]: 1616 mSDtfsCounter, 1504 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1692 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 04:53:57,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1692 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2024-10-11 04:53:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1812. [2024-10-11 04:53:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1810 states have (on average 1.6149171270718232) internal successors, (2923), 1811 states have internal predecessors, (2923), 0 states have call successors, (0), 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 04:53:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2923 transitions. [2024-10-11 04:53:57,793 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2923 transitions. Word has length 66 [2024-10-11 04:53:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:57,794 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2923 transitions. [2024-10-11 04:53:57,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2923 transitions. [2024-10-11 04:53:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:57,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:57,795 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] [2024-10-11 04:53:57,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 04:53:57,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash -170933700, now seen corresponding path program 1 times [2024-10-11 04:53:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:57,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752696216] [2024-10-11 04:53:57,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:57,830 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 04:53:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752696216] [2024-10-11 04:53:57,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752696216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:57,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:57,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:57,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460866043] [2024-10-11 04:53:57,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:57,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:57,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:57,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:57,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:57,832 INFO L87 Difference]: Start difference. First operand 1812 states and 2923 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:57,858 INFO L93 Difference]: Finished difference Result 2310 states and 3703 transitions. [2024-10-11 04:53:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:57,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 04:53:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:57,864 INFO L225 Difference]: With dead ends: 2310 [2024-10-11 04:53:57,864 INFO L226 Difference]: Without dead ends: 2049 [2024-10-11 04:53:57,864 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 04:53:57,865 INFO L432 NwaCegarLoop]: 1618 mSDtfsCounter, 1502 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1698 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 04:53:57,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1698 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2024-10-11 04:53:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2047. [2024-10-11 04:53:57,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 2045 states have (on average 1.6063569682151588) internal successors, (3285), 2046 states have internal predecessors, (3285), 0 states have call successors, (0), 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 04:53:57,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 3285 transitions. [2024-10-11 04:53:57,892 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 3285 transitions. Word has length 66 [2024-10-11 04:53:57,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:57,893 INFO L471 AbstractCegarLoop]: Abstraction has 2047 states and 3285 transitions. [2024-10-11 04:53:57,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 3285 transitions. [2024-10-11 04:53:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:57,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:57,894 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] [2024-10-11 04:53:57,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 04:53:57,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:57,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash -399572932, now seen corresponding path program 1 times [2024-10-11 04:53:57,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:57,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249365847] [2024-10-11 04:53:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:57,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:57,965 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 04:53:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249365847] [2024-10-11 04:53:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249365847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473984444] [2024-10-11 04:53:57,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:57,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:57,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:57,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:57,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:57,968 INFO L87 Difference]: Start difference. First operand 2047 states and 3285 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:58,008 INFO L93 Difference]: Finished difference Result 2991 states and 4747 transitions. [2024-10-11 04:53:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:58,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 04:53:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:58,015 INFO L225 Difference]: With dead ends: 2991 [2024-10-11 04:53:58,015 INFO L226 Difference]: Without dead ends: 2495 [2024-10-11 04:53:58,016 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 04:53:58,017 INFO L432 NwaCegarLoop]: 1606 mSDtfsCounter, 1498 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1694 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 04:53:58,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1694 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2024-10-11 04:53:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2493. [2024-10-11 04:53:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2491 states have (on average 1.5901244480128462) internal successors, (3961), 2492 states have internal predecessors, (3961), 0 states have call successors, (0), 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 04:53:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3961 transitions. [2024-10-11 04:53:58,064 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3961 transitions. Word has length 66 [2024-10-11 04:53:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:58,064 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 3961 transitions. [2024-10-11 04:53:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3961 transitions. [2024-10-11 04:53:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:58,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:58,065 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] [2024-10-11 04:53:58,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 04:53:58,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:58,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:58,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1025228996, now seen corresponding path program 1 times [2024-10-11 04:53:58,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:58,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196380089] [2024-10-11 04:53:58,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:58,111 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 04:53:58,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196380089] [2024-10-11 04:53:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196380089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:58,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:58,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:58,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485063224] [2024-10-11 04:53:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:58,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:58,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:58,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:58,114 INFO L87 Difference]: Start difference. First operand 2493 states and 3961 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:58,167 INFO L93 Difference]: Finished difference Result 4281 states and 6691 transitions. [2024-10-11 04:53:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 04:53:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:58,176 INFO L225 Difference]: With dead ends: 4281 [2024-10-11 04:53:58,176 INFO L226 Difference]: Without dead ends: 3339 [2024-10-11 04:53:58,178 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 04:53:58,179 INFO L432 NwaCegarLoop]: 1604 mSDtfsCounter, 1496 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1696 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 04:53:58,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1696 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2024-10-11 04:53:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2024-10-11 04:53:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3335 states have (on average 1.5643178410794603) internal successors, (5217), 3336 states have internal predecessors, (5217), 0 states have call successors, (0), 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 04:53:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 5217 transitions. [2024-10-11 04:53:58,253 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 5217 transitions. Word has length 66 [2024-10-11 04:53:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:58,253 INFO L471 AbstractCegarLoop]: Abstraction has 3337 states and 5217 transitions. [2024-10-11 04:53:58,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 5217 transitions. [2024-10-11 04:53:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:58,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:58,254 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] [2024-10-11 04:53:58,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 04:53:58,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:58,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash -136495556, now seen corresponding path program 1 times [2024-10-11 04:53:58,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:58,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18499672] [2024-10-11 04:53:58,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:58,300 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 04:53:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18499672] [2024-10-11 04:53:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18499672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:58,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:58,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118798754] [2024-10-11 04:53:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:58,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:58,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:58,303 INFO L87 Difference]: Start difference. First operand 3337 states and 5217 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:58,379 INFO L93 Difference]: Finished difference Result 6717 states and 10291 transitions. [2024-10-11 04:53:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:58,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 04:53:58,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:58,393 INFO L225 Difference]: With dead ends: 6717 [2024-10-11 04:53:58,393 INFO L226 Difference]: Without dead ends: 4931 [2024-10-11 04:53:58,396 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 04:53:58,397 INFO L432 NwaCegarLoop]: 1602 mSDtfsCounter, 1494 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1698 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 04:53:58,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1698 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4931 states. [2024-10-11 04:53:58,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4931 to 4929. [2024-10-11 04:53:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4929 states, 4927 states have (on average 1.5297341181246193) internal successors, (7537), 4928 states have internal predecessors, (7537), 0 states have call successors, (0), 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 04:53:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 7537 transitions. [2024-10-11 04:53:58,518 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 7537 transitions. Word has length 66 [2024-10-11 04:53:58,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:58,518 INFO L471 AbstractCegarLoop]: Abstraction has 4929 states and 7537 transitions. [2024-10-11 04:53:58,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 7537 transitions. [2024-10-11 04:53:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 04:53:58,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:58,519 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] [2024-10-11 04:53:58,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 04:53:58,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:58,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash -439516868, now seen corresponding path program 1 times [2024-10-11 04:53:58,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:58,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236482336] [2024-10-11 04:53:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:58,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:58,558 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 04:53:58,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:58,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236482336] [2024-10-11 04:53:58,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236482336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:58,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:58,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:53:58,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368620976] [2024-10-11 04:53:58,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:58,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:53:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:58,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:53:58,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:53:58,560 INFO L87 Difference]: Start difference. First operand 4929 states and 7537 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:58,652 INFO L93 Difference]: Finished difference Result 11301 states and 16915 transitions. [2024-10-11 04:53:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:53:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-11 04:53:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:58,666 INFO L225 Difference]: With dead ends: 11301 [2024-10-11 04:53:58,666 INFO L226 Difference]: Without dead ends: 7923 [2024-10-11 04:53:58,671 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 04:53:58,671 INFO L432 NwaCegarLoop]: 1616 mSDtfsCounter, 1500 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1700 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 04:53:58,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1700 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:53:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7923 states. [2024-10-11 04:53:58,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7923 to 7921. [2024-10-11 04:53:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7921 states, 7919 states have (on average 1.4892031822199772) internal successors, (11793), 7920 states have internal predecessors, (11793), 0 states have call successors, (0), 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 04:53:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7921 states to 7921 states and 11793 transitions. [2024-10-11 04:53:58,821 INFO L78 Accepts]: Start accepts. Automaton has 7921 states and 11793 transitions. Word has length 66 [2024-10-11 04:53:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:53:58,821 INFO L471 AbstractCegarLoop]: Abstraction has 7921 states and 11793 transitions. [2024-10-11 04:53:58,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:53:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7921 states and 11793 transitions. [2024-10-11 04:53:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:53:58,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:53:58,824 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] [2024-10-11 04:53:58,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 04:53:58,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:53:58,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:53:58,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1981614661, now seen corresponding path program 1 times [2024-10-11 04:53:58,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:53:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446917144] [2024-10-11 04:53:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:53:58,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:53:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:53:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 04:53:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:53:58,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446917144] [2024-10-11 04:53:58,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446917144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:53:58,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:53:58,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:53:58,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268198871] [2024-10-11 04:53:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:53:58,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:53:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:53:58,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:53:58,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:53:58,987 INFO L87 Difference]: Start difference. First operand 7921 states and 11793 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 04:53:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:53:59,573 INFO L93 Difference]: Finished difference Result 45567 states and 66616 transitions. [2024-10-11 04:53:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:53:59,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 04:53:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:53:59,632 INFO L225 Difference]: With dead ends: 45567 [2024-10-11 04:53:59,633 INFO L226 Difference]: Without dead ends: 41085 [2024-10-11 04:53:59,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:53:59,645 INFO L432 NwaCegarLoop]: 1628 mSDtfsCounter, 8061 mSDsluCounter, 2336 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8061 SdHoareTripleChecker+Valid, 3964 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:53:59,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8061 Valid, 3964 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:53:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41085 states. [2024-10-11 04:53:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41085 to 13361. [2024-10-11 04:54:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13361 states, 13359 states have (on average 1.4696459315817052) internal successors, (19633), 13360 states have internal predecessors, (19633), 0 states have call successors, (0), 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 04:54:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13361 states to 13361 states and 19633 transitions. [2024-10-11 04:54:00,032 INFO L78 Accepts]: Start accepts. Automaton has 13361 states and 19633 transitions. Word has length 86 [2024-10-11 04:54:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:00,032 INFO L471 AbstractCegarLoop]: Abstraction has 13361 states and 19633 transitions. [2024-10-11 04:54:00,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 04:54:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13361 states and 19633 transitions. [2024-10-11 04:54:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:54:00,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:00,036 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] [2024-10-11 04:54:00,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 04:54:00,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:00,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:00,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1902965947, now seen corresponding path program 1 times [2024-10-11 04:54:00,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072093255] [2024-10-11 04:54:00,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 04:54:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:00,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072093255] [2024-10-11 04:54:00,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072093255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:00,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:00,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:54:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457944074] [2024-10-11 04:54:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:00,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:54:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:54:00,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:54:00,159 INFO L87 Difference]: Start difference. First operand 13361 states and 19633 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 04:54:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:00,924 INFO L93 Difference]: Finished difference Result 51935 states and 75832 transitions. [2024-10-11 04:54:00,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:54:00,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 04:54:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:00,990 INFO L225 Difference]: With dead ends: 51935 [2024-10-11 04:54:00,990 INFO L226 Difference]: Without dead ends: 45565 [2024-10-11 04:54:01,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:54:01,005 INFO L432 NwaCegarLoop]: 1627 mSDtfsCounter, 8061 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8061 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:01,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8061 Valid, 3958 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:54:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45565 states. [2024-10-11 04:54:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45565 to 21969. [2024-10-11 04:54:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21969 states, 21967 states have (on average 1.4575044384758957) internal successors, (32017), 21968 states have internal predecessors, (32017), 0 states have call successors, (0), 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 04:54:01,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21969 states to 21969 states and 32017 transitions. [2024-10-11 04:54:01,684 INFO L78 Accepts]: Start accepts. Automaton has 21969 states and 32017 transitions. Word has length 86 [2024-10-11 04:54:01,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:01,684 INFO L471 AbstractCegarLoop]: Abstraction has 21969 states and 32017 transitions. [2024-10-11 04:54:01,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 04:54:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 21969 states and 32017 transitions. [2024-10-11 04:54:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:54:01,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:01,687 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] [2024-10-11 04:54:01,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 04:54:01,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:01,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1674326715, now seen corresponding path program 1 times [2024-10-11 04:54:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:01,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841979690] [2024-10-11 04:54:01,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 04:54:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841979690] [2024-10-11 04:54:01,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841979690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:01,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:01,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:54:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296236228] [2024-10-11 04:54:01,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:01,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:54:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:01,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:54:01,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:54:01,832 INFO L87 Difference]: Start difference. First operand 21969 states and 32017 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:02,714 INFO L93 Difference]: Finished difference Result 58303 states and 85016 transitions. [2024-10-11 04:54:02,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:54:02,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:54:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:02,778 INFO L225 Difference]: With dead ends: 58303 [2024-10-11 04:54:02,779 INFO L226 Difference]: Without dead ends: 51933 [2024-10-11 04:54:02,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:54:02,791 INFO L432 NwaCegarLoop]: 1625 mSDtfsCounter, 8101 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8101 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:02,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8101 Valid, 3975 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:54:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51933 states. [2024-10-11 04:54:03,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51933 to 28337. [2024-10-11 04:54:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28337 states, 28335 states have (on average 1.4540674077995412) internal successors, (41201), 28336 states have internal predecessors, (41201), 0 states have call successors, (0), 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 04:54:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28337 states to 28337 states and 41201 transitions. [2024-10-11 04:54:03,566 INFO L78 Accepts]: Start accepts. Automaton has 28337 states and 41201 transitions. Word has length 86 [2024-10-11 04:54:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:03,566 INFO L471 AbstractCegarLoop]: Abstraction has 28337 states and 41201 transitions. [2024-10-11 04:54:03,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28337 states and 41201 transitions. [2024-10-11 04:54:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:54:03,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:03,569 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] [2024-10-11 04:54:03,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 04:54:03,570 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:03,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1048670651, now seen corresponding path program 1 times [2024-10-11 04:54:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:03,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625252512] [2024-10-11 04:54:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 04:54:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625252512] [2024-10-11 04:54:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625252512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:03,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:54:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906881725] [2024-10-11 04:54:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:03,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:54:03,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:03,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:54:03,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:54:03,720 INFO L87 Difference]: Start difference. First operand 28337 states and 41201 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:04,978 INFO L93 Difference]: Finished difference Result 64671 states and 94200 transitions. [2024-10-11 04:54:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:54:04,979 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:54:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:05,048 INFO L225 Difference]: With dead ends: 64671 [2024-10-11 04:54:05,048 INFO L226 Difference]: Without dead ends: 58301 [2024-10-11 04:54:05,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:54:05,065 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 8155 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8155 SdHoareTripleChecker+Valid, 3938 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:05,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8155 Valid, 3938 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:54:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58301 states. [2024-10-11 04:54:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58301 to 34705. [2024-10-11 04:54:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34705 states, 34703 states have (on average 1.4518917672823675) internal successors, (50385), 34704 states have internal predecessors, (50385), 0 states have call successors, (0), 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 04:54:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34705 states to 34705 states and 50385 transitions. [2024-10-11 04:54:06,187 INFO L78 Accepts]: Start accepts. Automaton has 34705 states and 50385 transitions. Word has length 86 [2024-10-11 04:54:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:06,187 INFO L471 AbstractCegarLoop]: Abstraction has 34705 states and 50385 transitions. [2024-10-11 04:54:06,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:06,187 INFO L276 IsEmpty]: Start isEmpty. Operand 34705 states and 50385 transitions. [2024-10-11 04:54:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:54:06,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:06,191 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] [2024-10-11 04:54:06,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 04:54:06,191 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:06,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1937404091, now seen corresponding path program 1 times [2024-10-11 04:54:06,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:06,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598573695] [2024-10-11 04:54:06,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:06,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 04:54:06,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:06,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598573695] [2024-10-11 04:54:06,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598573695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:06,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:06,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:54:06,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457266141] [2024-10-11 04:54:06,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:06,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:54:06,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:06,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:54:06,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:54:06,321 INFO L87 Difference]: Start difference. First operand 34705 states and 50385 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:07,494 INFO L93 Difference]: Finished difference Result 71039 states and 103384 transitions. [2024-10-11 04:54:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:54:07,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:54:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:07,565 INFO L225 Difference]: With dead ends: 71039 [2024-10-11 04:54:07,565 INFO L226 Difference]: Without dead ends: 64669 [2024-10-11 04:54:07,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:54:07,582 INFO L432 NwaCegarLoop]: 1623 mSDtfsCounter, 8071 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8071 SdHoareTripleChecker+Valid, 3991 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:07,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8071 Valid, 3991 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:54:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64669 states. [2024-10-11 04:54:08,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64669 to 41073. [2024-10-11 04:54:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41073 states, 41071 states have (on average 1.4503907866864698) internal successors, (59569), 41072 states have internal predecessors, (59569), 0 states have call successors, (0), 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 04:54:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41073 states to 41073 states and 59569 transitions. [2024-10-11 04:54:08,853 INFO L78 Accepts]: Start accepts. Automaton has 41073 states and 59569 transitions. Word has length 86 [2024-10-11 04:54:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:08,854 INFO L471 AbstractCegarLoop]: Abstraction has 41073 states and 59569 transitions. [2024-10-11 04:54:08,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 41073 states and 59569 transitions. [2024-10-11 04:54:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 04:54:08,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:08,858 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] [2024-10-11 04:54:08,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 04:54:08,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:08,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:08,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1634382779, now seen corresponding path program 1 times [2024-10-11 04:54:08,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:08,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573155403] [2024-10-11 04:54:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:08,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 04:54:09,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:09,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573155403] [2024-10-11 04:54:09,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573155403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:09,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:09,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 04:54:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545873405] [2024-10-11 04:54:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:09,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 04:54:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 04:54:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 04:54:09,019 INFO L87 Difference]: Start difference. First operand 41073 states and 59569 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:10,663 INFO L93 Difference]: Finished difference Result 77407 states and 112568 transitions. [2024-10-11 04:54:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 04:54:10,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 04:54:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:10,754 INFO L225 Difference]: With dead ends: 77407 [2024-10-11 04:54:10,755 INFO L226 Difference]: Without dead ends: 71037 [2024-10-11 04:54:10,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-11 04:54:10,784 INFO L432 NwaCegarLoop]: 1622 mSDtfsCounter, 8010 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8010 SdHoareTripleChecker+Valid, 4111 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:10,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8010 Valid, 4111 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:54:10,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71037 states. [2024-10-11 04:54:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71037 to 47441. [2024-10-11 04:54:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47441 states, 47439 states have (on average 1.449292775986003) internal successors, (68753), 47440 states have internal predecessors, (68753), 0 states have call successors, (0), 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 04:54:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47441 states to 47441 states and 68753 transitions. [2024-10-11 04:54:12,255 INFO L78 Accepts]: Start accepts. Automaton has 47441 states and 68753 transitions. Word has length 86 [2024-10-11 04:54:12,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:12,255 INFO L471 AbstractCegarLoop]: Abstraction has 47441 states and 68753 transitions. [2024-10-11 04:54:12,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:54:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 47441 states and 68753 transitions. [2024-10-11 04:54:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 04:54:12,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:12,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:12,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 04:54:12,260 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:12,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1298476795, now seen corresponding path program 1 times [2024-10-11 04:54:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765057411] [2024-10-11 04:54:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765057411] [2024-10-11 04:54:12,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765057411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:12,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:12,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909635329] [2024-10-11 04:54:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:12,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:12,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:12,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:12,348 INFO L87 Difference]: Start difference. First operand 47441 states and 68753 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 04:54:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:13,431 INFO L93 Difference]: Finished difference Result 93333 states and 134995 transitions. [2024-10-11 04:54:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:13,431 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 04:54:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:13,485 INFO L225 Difference]: With dead ends: 93333 [2024-10-11 04:54:13,486 INFO L226 Difference]: Without dead ends: 47443 [2024-10-11 04:54:13,511 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 04:54:13,512 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 53 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3143 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:13,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3143 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47443 states. [2024-10-11 04:54:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47443 to 47441. [2024-10-11 04:54:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47441 states, 47439 states have (on average 1.4347899407660363) internal successors, (68065), 47440 states have internal predecessors, (68065), 0 states have call successors, (0), 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 04:54:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47441 states to 47441 states and 68065 transitions. [2024-10-11 04:54:15,080 INFO L78 Accepts]: Start accepts. Automaton has 47441 states and 68065 transitions. Word has length 87 [2024-10-11 04:54:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:15,081 INFO L471 AbstractCegarLoop]: Abstraction has 47441 states and 68065 transitions. [2024-10-11 04:54:15,081 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 04:54:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 47441 states and 68065 transitions. [2024-10-11 04:54:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 04:54:15,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:15,083 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:15,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 04:54:15,084 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:15,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1037402045, now seen corresponding path program 1 times [2024-10-11 04:54:15,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:15,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657100120] [2024-10-11 04:54:15,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:15,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:15,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:15,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657100120] [2024-10-11 04:54:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657100120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:15,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:15,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:15,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40230897] [2024-10-11 04:54:15,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:15,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:15,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:15,153 INFO L87 Difference]: Start difference. First operand 47441 states and 68065 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 04:54:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:15,559 INFO L93 Difference]: Finished difference Result 64265 states and 92328 transitions. [2024-10-11 04:54:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:15,559 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 04:54:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:15,583 INFO L225 Difference]: With dead ends: 64265 [2024-10-11 04:54:15,583 INFO L226 Difference]: Without dead ends: 18375 [2024-10-11 04:54:15,615 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 04:54:15,616 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 47 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:15,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3140 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18375 states. [2024-10-11 04:54:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18375 to 18368. [2024-10-11 04:54:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18368 states, 18366 states have (on average 1.4444081454862245) internal successors, (26528), 18367 states have internal predecessors, (26528), 0 states have call successors, (0), 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 04:54:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18368 states to 18368 states and 26528 transitions. [2024-10-11 04:54:16,244 INFO L78 Accepts]: Start accepts. Automaton has 18368 states and 26528 transitions. Word has length 88 [2024-10-11 04:54:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:16,244 INFO L471 AbstractCegarLoop]: Abstraction has 18368 states and 26528 transitions. [2024-10-11 04:54:16,244 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 04:54:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 18368 states and 26528 transitions. [2024-10-11 04:54:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 04:54:16,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:16,246 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] [2024-10-11 04:54:16,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 04:54:16,246 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:16,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:16,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1781311287, now seen corresponding path program 1 times [2024-10-11 04:54:16,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248085237] [2024-10-11 04:54:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248085237] [2024-10-11 04:54:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248085237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029027836] [2024-10-11 04:54:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:16,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:16,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:16,379 INFO L87 Difference]: Start difference. First operand 18368 states and 26528 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 04:54:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:16,559 INFO L93 Difference]: Finished difference Result 26772 states and 38530 transitions. [2024-10-11 04:54:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:16,560 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 04:54:16,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:16,574 INFO L225 Difference]: With dead ends: 26772 [2024-10-11 04:54:16,574 INFO L226 Difference]: Without dead ends: 9970 [2024-10-11 04:54:16,584 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 04:54:16,585 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 49 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3119 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:16,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3119 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9970 states. [2024-10-11 04:54:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9970 to 9968. [2024-10-11 04:54:16,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9966 states have (on average 1.4457154324703994) internal successors, (14408), 9967 states have internal predecessors, (14408), 0 states have call successors, (0), 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 04:54:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 14408 transitions. [2024-10-11 04:54:16,769 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 14408 transitions. Word has length 89 [2024-10-11 04:54:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:16,769 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 14408 transitions. [2024-10-11 04:54:16,769 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 04:54:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 14408 transitions. [2024-10-11 04:54:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 04:54:16,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:16,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 04:54:16,771 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2081860631, now seen corresponding path program 1 times [2024-10-11 04:54:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794423516] [2024-10-11 04:54:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:16,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:16,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794423516] [2024-10-11 04:54:16,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794423516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:16,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:16,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:16,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698675022] [2024-10-11 04:54:16,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:16,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:16,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:16,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:16,834 INFO L87 Difference]: Start difference. First operand 9968 states and 14408 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 04:54:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:16,931 INFO L93 Difference]: Finished difference Result 14172 states and 20350 transitions. [2024-10-11 04:54:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:16,931 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 04:54:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:16,939 INFO L225 Difference]: With dead ends: 14172 [2024-10-11 04:54:16,939 INFO L226 Difference]: Without dead ends: 5770 [2024-10-11 04:54:16,943 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 04:54:16,944 INFO L432 NwaCegarLoop]: 1583 mSDtfsCounter, 46 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3104 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:16,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3104 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2024-10-11 04:54:17,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5768. [2024-10-11 04:54:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5768 states, 5766 states have (on average 1.4582032604925426) internal successors, (8408), 5767 states have internal predecessors, (8408), 0 states have call successors, (0), 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 04:54:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5768 states to 5768 states and 8408 transitions. [2024-10-11 04:54:17,044 INFO L78 Accepts]: Start accepts. Automaton has 5768 states and 8408 transitions. Word has length 91 [2024-10-11 04:54:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:17,044 INFO L471 AbstractCegarLoop]: Abstraction has 5768 states and 8408 transitions. [2024-10-11 04:54:17,044 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 04:54:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5768 states and 8408 transitions. [2024-10-11 04:54:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 04:54:17,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:17,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:17,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 04:54:17,045 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:17,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash 207620325, now seen corresponding path program 1 times [2024-10-11 04:54:17,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023183324] [2024-10-11 04:54:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:17,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:17,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023183324] [2024-10-11 04:54:17,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023183324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:17,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:17,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984544244] [2024-10-11 04:54:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:17,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:17,125 INFO L87 Difference]: Start difference. First operand 5768 states and 8408 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 04:54:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:17,184 INFO L93 Difference]: Finished difference Result 7872 states and 11350 transitions. [2024-10-11 04:54:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:17,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-11 04:54:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:17,191 INFO L225 Difference]: With dead ends: 7872 [2024-10-11 04:54:17,191 INFO L226 Difference]: Without dead ends: 3670 [2024-10-11 04:54:17,194 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 04:54:17,194 INFO L432 NwaCegarLoop]: 1576 mSDtfsCounter, 43 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:17,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3089 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2024-10-11 04:54:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2024-10-11 04:54:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 3666 states have (on average 1.4833606110201856) internal successors, (5438), 3667 states have internal predecessors, (5438), 0 states have call successors, (0), 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 04:54:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 5438 transitions. [2024-10-11 04:54:17,253 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 5438 transitions. Word has length 93 [2024-10-11 04:54:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:17,254 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 5438 transitions. [2024-10-11 04:54:17,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 04:54:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 5438 transitions. [2024-10-11 04:54:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 04:54:17,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:17,255 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:54:17,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 04:54:17,255 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1099411661, now seen corresponding path program 1 times [2024-10-11 04:54:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:17,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225712211] [2024-10-11 04:54:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:17,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225712211] [2024-10-11 04:54:17,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225712211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:54:17,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:54:17,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:54:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519692463] [2024-10-11 04:54:17,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:54:17,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:54:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:54:17,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:54:17,325 INFO L87 Difference]: Start difference. First operand 3668 states and 5438 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 04:54:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:17,365 INFO L93 Difference]: Finished difference Result 4722 states and 6895 transitions. [2024-10-11 04:54:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:54:17,366 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 04:54:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:17,370 INFO L225 Difference]: With dead ends: 4722 [2024-10-11 04:54:17,370 INFO L226 Difference]: Without dead ends: 2620 [2024-10-11 04:54:17,371 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 04:54:17,372 INFO L432 NwaCegarLoop]: 1569 mSDtfsCounter, 40 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:17,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3074 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:54:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2024-10-11 04:54:17,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2618. [2024-10-11 04:54:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2616 states have (on average 1.5168195718654434) internal successors, (3968), 2617 states have internal predecessors, (3968), 0 states have call successors, (0), 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 04:54:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3968 transitions. [2024-10-11 04:54:17,409 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3968 transitions. Word has length 95 [2024-10-11 04:54:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:17,410 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 3968 transitions. [2024-10-11 04:54:17,410 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 04:54:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3968 transitions. [2024-10-11 04:54:17,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 04:54:17,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:17,410 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] [2024-10-11 04:54:17,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 04:54:17,411 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:17,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1010802943, now seen corresponding path program 1 times [2024-10-11 04:54:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622160226] [2024-10-11 04:54:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622160226] [2024-10-11 04:54:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622160226] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031174170] [2024-10-11 04:54:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:17,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:17,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:17,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:17,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:54:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:17,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:54:17,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:18,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031174170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:19,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:19,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-10-11 04:54:19,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113511090] [2024-10-11 04:54:19,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 04:54:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 04:54:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2024-10-11 04:54:19,251 INFO L87 Difference]: Start difference. First operand 2618 states and 3968 transitions. Second operand has 25 states, 25 states have (on average 10.56) internal successors, (264), 24 states have internal predecessors, (264), 0 states have call successors, (0), 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 04:54:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:20,664 INFO L93 Difference]: Finished difference Result 7012 states and 10005 transitions. [2024-10-11 04:54:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 04:54:20,665 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.56) internal successors, (264), 24 states have internal predecessors, (264), 0 states have call successors, (0), 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 97 [2024-10-11 04:54:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:20,672 INFO L225 Difference]: With dead ends: 7012 [2024-10-11 04:54:20,672 INFO L226 Difference]: Without dead ends: 5960 [2024-10-11 04:54:20,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=588, Invalid=2274, Unknown=0, NotChecked=0, Total=2862 [2024-10-11 04:54:20,674 INFO L432 NwaCegarLoop]: 1504 mSDtfsCounter, 22248 mSDsluCounter, 6595 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22248 SdHoareTripleChecker+Valid, 8099 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:20,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22248 Valid, 8099 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 04:54:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2024-10-11 04:54:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 5888. [2024-10-11 04:54:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5888 states, 5886 states have (on average 1.418280665987088) internal successors, (8348), 5887 states have internal predecessors, (8348), 0 states have call successors, (0), 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 04:54:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 8348 transitions. [2024-10-11 04:54:20,789 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 8348 transitions. Word has length 97 [2024-10-11 04:54:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:20,790 INFO L471 AbstractCegarLoop]: Abstraction has 5888 states and 8348 transitions. [2024-10-11 04:54:20,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.56) internal successors, (264), 24 states have internal predecessors, (264), 0 states have call successors, (0), 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 04:54:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 8348 transitions. [2024-10-11 04:54:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 04:54:20,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:20,791 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:54:20,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 04:54:20,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 04:54:20,992 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:20,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:20,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1517586763, now seen corresponding path program 1 times [2024-10-11 04:54:20,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:20,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514495130] [2024-10-11 04:54:20,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:20,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:21,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514495130] [2024-10-11 04:54:21,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514495130] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522909462] [2024-10-11 04:54:21,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:21,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:21,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:21,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:21,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:54:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:21,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 04:54:21,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:21,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:22,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522909462] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:22,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:22,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-10-11 04:54:22,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791621614] [2024-10-11 04:54:22,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:22,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 04:54:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:22,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 04:54:22,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-10-11 04:54:22,454 INFO L87 Difference]: Start difference. First operand 5888 states and 8348 transitions. Second operand has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 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 04:54:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:24,615 INFO L93 Difference]: Finished difference Result 24382 states and 33315 transitions. [2024-10-11 04:54:24,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-11 04:54:24,615 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 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 98 [2024-10-11 04:54:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:24,637 INFO L225 Difference]: With dead ends: 24382 [2024-10-11 04:54:24,638 INFO L226 Difference]: Without dead ends: 20060 [2024-10-11 04:54:24,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=677, Invalid=2515, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 04:54:24,644 INFO L432 NwaCegarLoop]: 1600 mSDtfsCounter, 23112 mSDsluCounter, 7284 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23112 SdHoareTripleChecker+Valid, 8884 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:24,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23112 Valid, 8884 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:54:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2024-10-11 04:54:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 19808. [2024-10-11 04:54:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19808 states, 19806 states have (on average 1.3393921034030092) internal successors, (26528), 19807 states have internal predecessors, (26528), 0 states have call successors, (0), 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 04:54:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19808 states to 19808 states and 26528 transitions. [2024-10-11 04:54:25,107 INFO L78 Accepts]: Start accepts. Automaton has 19808 states and 26528 transitions. Word has length 98 [2024-10-11 04:54:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:25,107 INFO L471 AbstractCegarLoop]: Abstraction has 19808 states and 26528 transitions. [2024-10-11 04:54:25,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.76923076923077) internal successors, (254), 25 states have internal predecessors, (254), 0 states have call successors, (0), 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 04:54:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 19808 states and 26528 transitions. [2024-10-11 04:54:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 04:54:25,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:25,109 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:54:25,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:54:25,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 04:54:25,310 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1783256229, now seen corresponding path program 1 times [2024-10-11 04:54:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:25,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466725703] [2024-10-11 04:54:25,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:25,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466725703] [2024-10-11 04:54:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466725703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394835475] [2024-10-11 04:54:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:25,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:25,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:25,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:25,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:54:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:25,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 04:54:25,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:27,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394835475] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:29,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:29,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 18] total 41 [2024-10-11 04:54:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640596301] [2024-10-11 04:54:29,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:29,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 04:54:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 04:54:29,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1371, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 04:54:29,601 INFO L87 Difference]: Start difference. First operand 19808 states and 26528 transitions. Second operand has 41 states, 41 states have (on average 6.414634146341464) internal successors, (263), 41 states have internal predecessors, (263), 0 states have call successors, (0), 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 04:54:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:44,797 INFO L93 Difference]: Finished difference Result 110638 states and 146841 transitions. [2024-10-11 04:54:44,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2024-10-11 04:54:44,797 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.414634146341464) internal successors, (263), 41 states have internal predecessors, (263), 0 states have call successors, (0), 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 100 [2024-10-11 04:54:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:44,895 INFO L225 Difference]: With dead ends: 110638 [2024-10-11 04:54:44,895 INFO L226 Difference]: Without dead ends: 92396 [2024-10-11 04:54:44,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10766 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=4994, Invalid=23398, Unknown=0, NotChecked=0, Total=28392 [2024-10-11 04:54:44,928 INFO L432 NwaCegarLoop]: 1607 mSDtfsCounter, 21182 mSDsluCounter, 17100 mSDsCounter, 0 mSdLazyCounter, 3921 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21182 SdHoareTripleChecker+Valid, 18707 SdHoareTripleChecker+Invalid, 4026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 3921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:44,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21182 Valid, 18707 Invalid, 4026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 3921 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 04:54:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92396 states. [2024-10-11 04:54:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92396 to 54008. [2024-10-11 04:54:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54008 states, 54006 states have (on average 1.3144465429767063) internal successors, (70988), 54007 states have internal predecessors, (70988), 0 states have call successors, (0), 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 04:54:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54008 states to 54008 states and 70988 transitions. [2024-10-11 04:54:46,900 INFO L78 Accepts]: Start accepts. Automaton has 54008 states and 70988 transitions. Word has length 100 [2024-10-11 04:54:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:46,900 INFO L471 AbstractCegarLoop]: Abstraction has 54008 states and 70988 transitions. [2024-10-11 04:54:46,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.414634146341464) internal successors, (263), 41 states have internal predecessors, (263), 0 states have call successors, (0), 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 04:54:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 54008 states and 70988 transitions. [2024-10-11 04:54:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 04:54:46,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:46,903 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:54:46,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 04:54:47,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:47,103 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:47,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash -671555361, now seen corresponding path program 1 times [2024-10-11 04:54:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:47,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185736080] [2024-10-11 04:54:47,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:47,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185736080] [2024-10-11 04:54:47,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185736080] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004036278] [2024-10-11 04:54:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:47,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:47,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:47,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:54:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:47,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 04:54:47,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:47,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:48,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004036278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:48,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:48,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 04:54:48,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634938915] [2024-10-11 04:54:48,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:48,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 04:54:48,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:48,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 04:54:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-10-11 04:54:48,416 INFO L87 Difference]: Start difference. First operand 54008 states and 70988 transitions. Second operand has 22 states, 22 states have (on average 10.954545454545455) internal successors, (241), 21 states have internal predecessors, (241), 0 states have call successors, (0), 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 04:54:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:54:52,108 INFO L93 Difference]: Finished difference Result 162854 states and 213851 transitions. [2024-10-11 04:54:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 04:54:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.954545454545455) internal successors, (241), 21 states have internal predecessors, (241), 0 states have call successors, (0), 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 101 [2024-10-11 04:54:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:54:52,239 INFO L225 Difference]: With dead ends: 162854 [2024-10-11 04:54:52,239 INFO L226 Difference]: Without dead ends: 110412 [2024-10-11 04:54:52,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2024-10-11 04:54:52,274 INFO L432 NwaCegarLoop]: 1527 mSDtfsCounter, 10605 mSDsluCounter, 4754 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10605 SdHoareTripleChecker+Valid, 6281 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 04:54:52,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10605 Valid, 6281 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 04:54:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110412 states. [2024-10-11 04:54:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110412 to 109088. [2024-10-11 04:54:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109088 states, 109086 states have (on average 1.2964816750087087) internal successors, (141428), 109087 states have internal predecessors, (141428), 0 states have call successors, (0), 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 04:54:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109088 states to 109088 states and 141428 transitions. [2024-10-11 04:54:56,077 INFO L78 Accepts]: Start accepts. Automaton has 109088 states and 141428 transitions. Word has length 101 [2024-10-11 04:54:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:54:56,078 INFO L471 AbstractCegarLoop]: Abstraction has 109088 states and 141428 transitions. [2024-10-11 04:54:56,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.954545454545455) internal successors, (241), 21 states have internal predecessors, (241), 0 states have call successors, (0), 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 04:54:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 109088 states and 141428 transitions. [2024-10-11 04:54:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 04:54:56,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:54:56,082 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 04:54:56,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 04:54:56,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 04:54:56,282 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:54:56,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:54:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1070686223, now seen corresponding path program 1 times [2024-10-11 04:54:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:54:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124578134] [2024-10-11 04:54:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:54:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:54:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124578134] [2024-10-11 04:54:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124578134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:54:57,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137691830] [2024-10-11 04:54:57,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:54:57,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:54:57,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:54:57,190 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:54:57,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:54:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:54:57,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 04:54:57,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:54:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:57,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:54:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:54:58,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137691830] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:54:58,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:54:58,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2024-10-11 04:54:58,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563130749] [2024-10-11 04:54:58,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:54:58,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 04:54:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:54:58,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 04:54:58,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 04:54:58,790 INFO L87 Difference]: Start difference. First operand 109088 states and 141428 transitions. Second operand has 35 states, 35 states have (on average 8.057142857142857) internal successors, (282), 35 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)