./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6e57a5fe539c02a3f122e940e947b466cbee4432e151d616552c45a0bb305ecc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:47:18,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:47:18,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:47:18,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:47:18,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:47:18,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:47:18,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:47:18,439 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:47:18,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:47:18,441 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:47:18,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:47:18,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:47:18,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:47:18,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:47:18,445 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:47:18,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:47:18,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:47:18,446 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:47:18,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:47:18,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:47:18,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:47:18,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:47:18,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:47:18,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:47:18,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:47:18,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:47:18,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:47:18,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:47:18,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:47:18,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:47:18,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:47:18,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:47:18,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:47:18,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:47:18,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:47:18,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:47:18,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:47:18,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:47:18,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:47:18,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:47:18,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:47:18,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:47:18,458 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/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/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 -> 6e57a5fe539c02a3f122e940e947b466cbee4432e151d616552c45a0bb305ecc [2024-11-11 22:47:18,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:47:18,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:47:18,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:47:18,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:47:18,756 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:47:18,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c [2024-11-11 22:47:20,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:47:20,768 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:47:20,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c [2024-11-11 22:47:20,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3523cb5d9/05a9ece024d44808ad104465d2306464/FLAG4427245d7 [2024-11-11 22:47:20,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3523cb5d9/05a9ece024d44808ad104465d2306464 [2024-11-11 22:47:20,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:47:20,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:47:20,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:47:20,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:47:20,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:47:20,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:47:20" (1/1) ... [2024-11-11 22:47:20,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46463207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:20, skipping insertion in model container [2024-11-11 22:47:20,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:47:20" (1/1) ... [2024-11-11 22:47:20,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:47:21,377 WARN L250 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.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c[20463,20476] [2024-11-11 22:47:21,455 WARN L250 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.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c[27753,27766] [2024-11-11 22:47:22,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:47:22,057 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:47:22,118 WARN L250 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.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c[20463,20476] [2024-11-11 22:47:22,131 WARN L250 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.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c[27753,27766] [2024-11-11 22:47:22,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:47:22,513 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:47:22,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22 WrapperNode [2024-11-11 22:47:22,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:47:22,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:47:22,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:47:22,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:47:22,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:22,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:22,983 INFO L138 Inliner]: procedures = 38, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5222 [2024-11-11 22:47:22,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:47:22,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:47:22,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:47:22,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:47:22,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:22,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,248 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-11-11 22:47:23,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:47:23,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:47:23,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:47:23,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:47:23,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (1/1) ... [2024-11-11 22:47:23,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:47:23,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:47:23,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:47:23,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:47:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:47:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:47:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:47:23,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:47:23,677 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:47:23,727 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:47:28,357 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-11 22:47:28,358 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:47:28,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:47:28,400 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 22:47:28,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:47:28 BoogieIcfgContainer [2024-11-11 22:47:28,401 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:47:28,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:47:28,403 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:47:28,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:47:28,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:47:20" (1/3) ... [2024-11-11 22:47:28,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625ab978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:47:28, skipping insertion in model container [2024-11-11 22:47:28,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:47:22" (2/3) ... [2024-11-11 22:47:28,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625ab978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:47:28, skipping insertion in model container [2024-11-11 22:47:28,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:47:28" (3/3) ... [2024-11-11 22:47:28,410 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals+Problem12_label02.c [2024-11-11 22:47:28,425 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:47:28,426 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:47:28,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:47:28,572 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;@76c4332f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:47:28,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:47:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 930 states, 927 states have (on average 1.9039913700107876) internal successors, (1765), 929 states have internal predecessors, (1765), 0 states have call successors, (0), 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-11-11 22:47:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 22:47:28,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:28,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:28,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:28,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 495960789, now seen corresponding path program 1 times [2024-11-11 22:47:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:28,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418741131] [2024-11-11 22:47:28,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:28,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418741131] [2024-11-11 22:47:28,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418741131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:28,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 22:47:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392189313] [2024-11-11 22:47:28,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:28,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 22:47:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 22:47:28,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:47:28,992 INFO L87 Difference]: Start difference. First operand has 930 states, 927 states have (on average 1.9039913700107876) internal successors, (1765), 929 states have internal predecessors, (1765), 0 states have call successors, (0), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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-11-11 22:47:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:29,075 INFO L93 Difference]: Finished difference Result 1804 states and 3422 transitions. [2024-11-11 22:47:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 22:47:29,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-11 22:47:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:29,101 INFO L225 Difference]: With dead ends: 1804 [2024-11-11 22:47:29,102 INFO L226 Difference]: Without dead ends: 864 [2024-11-11 22:47:29,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 22:47:29,112 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:29,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-11 22:47:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2024-11-11 22:47:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8932714617169373) internal successors, (1632), 863 states have internal predecessors, (1632), 0 states have call successors, (0), 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-11-11 22:47:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1632 transitions. [2024-11-11 22:47:29,197 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1632 transitions. Word has length 28 [2024-11-11 22:47:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:29,198 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1632 transitions. [2024-11-11 22:47:29,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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-11-11 22:47:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1632 transitions. [2024-11-11 22:47:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 22:47:29,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:29,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:29,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:47:29,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:29,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash 714815507, now seen corresponding path program 1 times [2024-11-11 22:47:29,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:29,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979317784] [2024-11-11 22:47:29,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:29,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:29,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979317784] [2024-11-11 22:47:29,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979317784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:29,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:47:29,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209724997] [2024-11-11 22:47:29,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:29,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:47:29,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:29,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:47:29,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:47:29,468 INFO L87 Difference]: Start difference. First operand 864 states and 1632 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-11-11 22:47:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:29,611 INFO L93 Difference]: Finished difference Result 922 states and 1723 transitions. [2024-11-11 22:47:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 22:47:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-11 22:47:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:29,617 INFO L225 Difference]: With dead ends: 922 [2024-11-11 22:47:29,617 INFO L226 Difference]: Without dead ends: 864 [2024-11-11 22:47:29,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:47:29,619 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 0 mSDsluCounter, 4835 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6465 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:29,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6465 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:47:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-11 22:47:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2024-11-11 22:47:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 862 states have (on average 1.8352668213457077) internal successors, (1582), 863 states have internal predecessors, (1582), 0 states have call successors, (0), 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-11-11 22:47:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1582 transitions. [2024-11-11 22:47:29,655 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1582 transitions. Word has length 28 [2024-11-11 22:47:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:29,655 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1582 transitions. [2024-11-11 22:47:29,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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-11-11 22:47:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1582 transitions. [2024-11-11 22:47:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 22:47:29,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:29,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:29,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:47:29,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:29,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash -66488912, now seen corresponding path program 1 times [2024-11-11 22:47:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:29,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209016137] [2024-11-11 22:47:29,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:29,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:29,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209016137] [2024-11-11 22:47:29,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209016137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:29,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:29,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:29,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501915726] [2024-11-11 22:47:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:29,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 22:47:29,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:29,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 22:47:29,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 22:47:29,968 INFO L87 Difference]: Start difference. First operand 864 states and 1582 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-11 22:47:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:35,780 INFO L93 Difference]: Finished difference Result 3119 states and 5891 transitions. [2024-11-11 22:47:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 22:47:35,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-11 22:47:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:35,791 INFO L225 Difference]: With dead ends: 3119 [2024-11-11 22:47:35,791 INFO L226 Difference]: Without dead ends: 2366 [2024-11-11 22:47:35,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:47:35,793 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 2461 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2461 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:35,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2461 Valid, 854 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-11 22:47:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2366 states. [2024-11-11 22:47:35,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2366 to 2366. [2024-11-11 22:47:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2364 states have (on average 1.5685279187817258) internal successors, (3708), 2365 states have internal predecessors, (3708), 0 states have call successors, (0), 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-11-11 22:47:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3708 transitions. [2024-11-11 22:47:35,847 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3708 transitions. Word has length 63 [2024-11-11 22:47:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:35,849 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3708 transitions. [2024-11-11 22:47:35,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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-11-11 22:47:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3708 transitions. [2024-11-11 22:47:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 22:47:35,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:35,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:35,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:47:35,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:35,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:35,859 INFO L85 PathProgramCache]: Analyzing trace with hash -585081934, now seen corresponding path program 1 times [2024-11-11 22:47:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:35,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454497251] [2024-11-11 22:47:35,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:35,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:36,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:36,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454497251] [2024-11-11 22:47:36,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454497251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:36,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:36,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:47:36,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689697282] [2024-11-11 22:47:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:36,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:47:36,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:47:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:47:36,192 INFO L87 Difference]: Start difference. First operand 2366 states and 3708 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-11-11 22:47:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:36,652 INFO L93 Difference]: Finished difference Result 3122 states and 4926 transitions. [2024-11-11 22:47:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:47:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-11 22:47:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:36,667 INFO L225 Difference]: With dead ends: 3122 [2024-11-11 22:47:36,668 INFO L226 Difference]: Without dead ends: 3068 [2024-11-11 22:47:36,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-11 22:47:36,670 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 11503 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11503 SdHoareTripleChecker+Valid, 5134 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:36,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11503 Valid, 5134 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:47:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2024-11-11 22:47:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2418. [2024-11-11 22:47:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5695364238410596) internal successors, (3792), 2417 states have internal predecessors, (3792), 0 states have call successors, (0), 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-11-11 22:47:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3792 transitions. [2024-11-11 22:47:36,728 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3792 transitions. Word has length 77 [2024-11-11 22:47:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:36,729 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3792 transitions. [2024-11-11 22:47:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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-11-11 22:47:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3792 transitions. [2024-11-11 22:47:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:47:36,734 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:36,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:36,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:47:36,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1038714270, now seen corresponding path program 1 times [2024-11-11 22:47:36,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:36,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631457164] [2024-11-11 22:47:36,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:36,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:36,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631457164] [2024-11-11 22:47:36,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631457164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:36,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687457666] [2024-11-11 22:47:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:36,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:47:36,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:36,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:47:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:36,857 INFO L87 Difference]: Start difference. First operand 2418 states and 3792 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:47:36,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:36,897 INFO L93 Difference]: Finished difference Result 2619 states and 4115 transitions. [2024-11-11 22:47:36,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:47:36,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-11 22:47:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:36,907 INFO L225 Difference]: With dead ends: 2619 [2024-11-11 22:47:36,907 INFO L226 Difference]: Without dead ends: 2513 [2024-11-11 22:47:36,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:36,909 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 1498 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1662 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-11-11 22:47:36,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1662 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-11 22:47:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2024-11-11 22:47:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.570346751693902) internal successors, (3940), 2510 states have internal predecessors, (3940), 0 states have call successors, (0), 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-11-11 22:47:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3940 transitions. [2024-11-11 22:47:36,957 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3940 transitions. Word has length 79 [2024-11-11 22:47:36,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:36,957 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3940 transitions. [2024-11-11 22:47:36,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:47:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3940 transitions. [2024-11-11 22:47:36,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-11 22:47:36,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:36,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:36,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:47:36,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash -972220758, now seen corresponding path program 1 times [2024-11-11 22:47:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832324087] [2024-11-11 22:47:36,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:37,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:37,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832324087] [2024-11-11 22:47:37,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832324087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:47:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672312769] [2024-11-11 22:47:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:37,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:47:37,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:37,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:47:37,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:47:37,392 INFO L87 Difference]: Start difference. First operand 2511 states and 3940 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-11-11 22:47:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:37,789 INFO L93 Difference]: Finished difference Result 2712 states and 4260 transitions. [2024-11-11 22:47:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:47:37,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-11 22:47:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:37,805 INFO L225 Difference]: With dead ends: 2712 [2024-11-11 22:47:37,805 INFO L226 Difference]: Without dead ends: 2513 [2024-11-11 22:47:37,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-11 22:47:37,809 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 10553 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10553 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:37,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10553 Valid, 2077 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:47:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-11 22:47:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2511. [2024-11-11 22:47:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2509 states have (on average 1.5695496213630928) internal successors, (3938), 2510 states have internal predecessors, (3938), 0 states have call successors, (0), 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-11-11 22:47:37,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3938 transitions. [2024-11-11 22:47:37,864 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3938 transitions. Word has length 79 [2024-11-11 22:47:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:37,866 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3938 transitions. [2024-11-11 22:47:37,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 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-11-11 22:47:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3938 transitions. [2024-11-11 22:47:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 22:47:37,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:37,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:37,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:47:37,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:37,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash -488795339, now seen corresponding path program 1 times [2024-11-11 22:47:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:37,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790026734] [2024-11-11 22:47:37,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:37,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:38,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:38,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790026734] [2024-11-11 22:47:38,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790026734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:38,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:38,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:47:38,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422426539] [2024-11-11 22:47:38,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:38,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:47:38,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:38,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:47:38,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:47:38,198 INFO L87 Difference]: Start difference. First operand 2511 states and 3938 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:47:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:38,309 INFO L93 Difference]: Finished difference Result 2519 states and 3947 transitions. [2024-11-11 22:47:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:47:38,310 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-11 22:47:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:38,318 INFO L225 Difference]: With dead ends: 2519 [2024-11-11 22:47:38,318 INFO L226 Difference]: Without dead ends: 2517 [2024-11-11 22:47:38,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:47:38,321 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 0 mSDsluCounter, 9443 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11019 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:38,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11019 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2517 states. [2024-11-11 22:47:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2517 to 2517. [2024-11-11 22:47:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2515 states have (on average 1.5677932405566601) internal successors, (3943), 2516 states have internal predecessors, (3943), 0 states have call successors, (0), 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-11-11 22:47:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3943 transitions. [2024-11-11 22:47:38,367 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3943 transitions. Word has length 80 [2024-11-11 22:47:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:38,367 INFO L471 AbstractCegarLoop]: Abstraction has 2517 states and 3943 transitions. [2024-11-11 22:47:38,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:47:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3943 transitions. [2024-11-11 22:47:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:47:38,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:38,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:38,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:47:38,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:38,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash 295676394, now seen corresponding path program 1 times [2024-11-11 22:47:38,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:38,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092919571] [2024-11-11 22:47:38,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:38,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092919571] [2024-11-11 22:47:38,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092919571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:38,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:38,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762790994] [2024-11-11 22:47:38,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:38,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:47:38,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:38,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:47:38,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:38,463 INFO L87 Difference]: Start difference. First operand 2517 states and 3943 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:38,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:38,507 INFO L93 Difference]: Finished difference Result 2735 states and 4284 transitions. [2024-11-11 22:47:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:47:38,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-11 22:47:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:38,519 INFO L225 Difference]: With dead ends: 2735 [2024-11-11 22:47:38,519 INFO L226 Difference]: Without dead ends: 2623 [2024-11-11 22:47:38,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:38,523 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 1516 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:38,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1742 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-11-11 22:47:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2621. [2024-11-11 22:47:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2621 states, 2619 states have (on average 1.5670103092783505) internal successors, (4104), 2620 states have internal predecessors, (4104), 0 states have call successors, (0), 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-11-11 22:47:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2621 states and 4104 transitions. [2024-11-11 22:47:38,577 INFO L78 Accepts]: Start accepts. Automaton has 2621 states and 4104 transitions. Word has length 81 [2024-11-11 22:47:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:38,578 INFO L471 AbstractCegarLoop]: Abstraction has 2621 states and 4104 transitions. [2024-11-11 22:47:38,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2621 states and 4104 transitions. [2024-11-11 22:47:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:47:38,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:38,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:38,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:47:38,579 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:38,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2057221398, now seen corresponding path program 1 times [2024-11-11 22:47:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:38,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183420289] [2024-11-11 22:47:38,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:38,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:38,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183420289] [2024-11-11 22:47:38,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183420289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:38,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839892512] [2024-11-11 22:47:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:38,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:47:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:47:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:38,650 INFO L87 Difference]: Start difference. First operand 2621 states and 4104 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:38,694 INFO L93 Difference]: Finished difference Result 3211 states and 5024 transitions. [2024-11-11 22:47:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:47:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-11 22:47:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:38,705 INFO L225 Difference]: With dead ends: 3211 [2024-11-11 22:47:38,705 INFO L226 Difference]: Without dead ends: 2904 [2024-11-11 22:47:38,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:38,708 INFO L435 NwaCegarLoop]: 1656 mSDtfsCounter, 1514 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:38,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2024-11-11 22:47:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 2902. [2024-11-11 22:47:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2900 states have (on average 1.5641379310344827) internal successors, (4536), 2901 states have internal predecessors, (4536), 0 states have call successors, (0), 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-11-11 22:47:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 4536 transitions. [2024-11-11 22:47:38,775 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 4536 transitions. Word has length 81 [2024-11-11 22:47:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:38,776 INFO L471 AbstractCegarLoop]: Abstraction has 2902 states and 4536 transitions. [2024-11-11 22:47:38,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:38,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 4536 transitions. [2024-11-11 22:47:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:47:38,777 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:38,777 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:38,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:47:38,778 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:38,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1894306838, now seen corresponding path program 1 times [2024-11-11 22:47:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:38,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615910531] [2024-11-11 22:47:38,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:38,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:38,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:38,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615910531] [2024-11-11 22:47:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615910531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:38,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:38,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:38,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348614361] [2024-11-11 22:47:38,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:38,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:47:38,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:47:38,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:38,851 INFO L87 Difference]: Start difference. First operand 2902 states and 4536 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:38,910 INFO L93 Difference]: Finished difference Result 4030 states and 6278 transitions. [2024-11-11 22:47:38,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:47:38,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-11 22:47:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:38,924 INFO L225 Difference]: With dead ends: 4030 [2024-11-11 22:47:38,924 INFO L226 Difference]: Without dead ends: 3442 [2024-11-11 22:47:38,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:38,927 INFO L435 NwaCegarLoop]: 1654 mSDtfsCounter, 1512 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:38,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 1750 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2024-11-11 22:47:38,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3440. [2024-11-11 22:47:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3440 states, 3438 states have (on average 1.556719022687609) internal successors, (5352), 3439 states have internal predecessors, (5352), 0 states have call successors, (0), 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-11-11 22:47:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 5352 transitions. [2024-11-11 22:47:39,006 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 5352 transitions. Word has length 81 [2024-11-11 22:47:39,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:39,006 INFO L471 AbstractCegarLoop]: Abstraction has 3440 states and 5352 transitions. [2024-11-11 22:47:39,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 5352 transitions. [2024-11-11 22:47:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:47:39,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:39,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:39,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:47:39,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:39,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:39,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1630450454, now seen corresponding path program 1 times [2024-11-11 22:47:39,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:39,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306249894] [2024-11-11 22:47:39,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:39,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306249894] [2024-11-11 22:47:39,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306249894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:39,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87823386] [2024-11-11 22:47:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:39,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:47:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:39,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:47:39,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:39,075 INFO L87 Difference]: Start difference. First operand 3440 states and 5352 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:39,136 INFO L93 Difference]: Finished difference Result 5596 states and 8642 transitions. [2024-11-11 22:47:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:47:39,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-11 22:47:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:39,145 INFO L225 Difference]: With dead ends: 5596 [2024-11-11 22:47:39,145 INFO L226 Difference]: Without dead ends: 4470 [2024-11-11 22:47:39,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:39,149 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1510 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:39,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1752 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4470 states. [2024-11-11 22:47:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4470 to 4468. [2024-11-11 22:47:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4468 states, 4466 states have (on average 1.542319749216301) internal successors, (6888), 4467 states have internal predecessors, (6888), 0 states have call successors, (0), 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-11-11 22:47:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 6888 transitions. [2024-11-11 22:47:39,251 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 6888 transitions. Word has length 81 [2024-11-11 22:47:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:39,252 INFO L471 AbstractCegarLoop]: Abstraction has 4468 states and 6888 transitions. [2024-11-11 22:47:39,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 6888 transitions. [2024-11-11 22:47:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:47:39,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:39,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:39,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:47:39,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:39,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:39,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1687310058, now seen corresponding path program 1 times [2024-11-11 22:47:39,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:39,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944667904] [2024-11-11 22:47:39,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:39,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:39,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944667904] [2024-11-11 22:47:39,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944667904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:39,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:39,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220134057] [2024-11-11 22:47:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:39,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:47:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:47:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:39,325 INFO L87 Difference]: Start difference. First operand 4468 states and 6888 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:39,473 INFO L93 Difference]: Finished difference Result 8584 states and 13082 transitions. [2024-11-11 22:47:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:47:39,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-11 22:47:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:39,490 INFO L225 Difference]: With dead ends: 8584 [2024-11-11 22:47:39,491 INFO L226 Difference]: Without dead ends: 6430 [2024-11-11 22:47:39,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:39,497 INFO L435 NwaCegarLoop]: 1640 mSDtfsCounter, 1506 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:39,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:39,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6430 states. [2024-11-11 22:47:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6430 to 6428. [2024-11-11 22:47:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6428 states, 6426 states have (on average 1.5200746965452847) internal successors, (9768), 6427 states have internal predecessors, (9768), 0 states have call successors, (0), 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-11-11 22:47:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6428 states to 6428 states and 9768 transitions. [2024-11-11 22:47:39,710 INFO L78 Accepts]: Start accepts. Automaton has 6428 states and 9768 transitions. Word has length 81 [2024-11-11 22:47:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:39,710 INFO L471 AbstractCegarLoop]: Abstraction has 6428 states and 9768 transitions. [2024-11-11 22:47:39,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 6428 states and 9768 transitions. [2024-11-11 22:47:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:47:39,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:39,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:39,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 22:47:39,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -826724374, now seen corresponding path program 1 times [2024-11-11 22:47:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678824972] [2024-11-11 22:47:39,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:39,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678824972] [2024-11-11 22:47:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678824972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:39,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128158014] [2024-11-11 22:47:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:39,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:47:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:39,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:47:39,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:39,798 INFO L87 Difference]: Start difference. First operand 6428 states and 9768 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:39,975 INFO L93 Difference]: Finished difference Result 14272 states and 21386 transitions. [2024-11-11 22:47:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:47:39,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-11 22:47:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:39,998 INFO L225 Difference]: With dead ends: 14272 [2024-11-11 22:47:39,999 INFO L226 Difference]: Without dead ends: 10158 [2024-11-11 22:47:40,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:40,011 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 1504 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:40,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1750 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:40,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10158 states. [2024-11-11 22:47:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10158 to 10156. [2024-11-11 22:47:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10156 states, 10154 states have (on average 1.4914319480007878) internal successors, (15144), 10155 states have internal predecessors, (15144), 0 states have call successors, (0), 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-11-11 22:47:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10156 states to 10156 states and 15144 transitions. [2024-11-11 22:47:40,269 INFO L78 Accepts]: Start accepts. Automaton has 10156 states and 15144 transitions. Word has length 81 [2024-11-11 22:47:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:40,269 INFO L471 AbstractCegarLoop]: Abstraction has 10156 states and 15144 transitions. [2024-11-11 22:47:40,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 10156 states and 15144 transitions. [2024-11-11 22:47:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-11 22:47:40,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:40,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:40,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:47:40,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:40,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:40,271 INFO L85 PathProgramCache]: Analyzing trace with hash -392188438, now seen corresponding path program 1 times [2024-11-11 22:47:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:40,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721535185] [2024-11-11 22:47:40,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:47:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721535185] [2024-11-11 22:47:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721535185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:40,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 22:47:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484764663] [2024-11-11 22:47:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:40,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 22:47:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 22:47:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:40,334 INFO L87 Difference]: Start difference. First operand 10156 states and 15144 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:40,689 INFO L93 Difference]: Finished difference Result 25072 states and 36842 transitions. [2024-11-11 22:47:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 22:47:40,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-11 22:47:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:40,723 INFO L225 Difference]: With dead ends: 25072 [2024-11-11 22:47:40,723 INFO L226 Difference]: Without dead ends: 17230 [2024-11-11 22:47:40,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 22:47:40,737 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1508 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:40,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1754 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 22:47:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17230 states. [2024-11-11 22:47:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17230 to 17228. [2024-11-11 22:47:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17228 states, 17226 states have (on average 1.4587251828631138) internal successors, (25128), 17227 states have internal predecessors, (25128), 0 states have call successors, (0), 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-11-11 22:47:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17228 states to 17228 states and 25128 transitions. [2024-11-11 22:47:41,195 INFO L78 Accepts]: Start accepts. Automaton has 17228 states and 25128 transitions. Word has length 81 [2024-11-11 22:47:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:41,195 INFO L471 AbstractCegarLoop]: Abstraction has 17228 states and 25128 transitions. [2024-11-11 22:47:41,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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-11-11 22:47:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 17228 states and 25128 transitions. [2024-11-11 22:47:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:47:41,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:41,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:41,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:47:41,202 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:41,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:41,203 INFO L85 PathProgramCache]: Analyzing trace with hash -730351122, now seen corresponding path program 1 times [2024-11-11 22:47:41,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:41,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894681147] [2024-11-11 22:47:41,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:41,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 22:47:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894681147] [2024-11-11 22:47:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894681147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:47:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098753949] [2024-11-11 22:47:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:41,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:47:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:47:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:47:41,467 INFO L87 Difference]: Start difference. First operand 17228 states and 25128 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:47:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:43,895 INFO L93 Difference]: Finished difference Result 120284 states and 173616 transitions. [2024-11-11 22:47:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:47:43,896 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-11 22:47:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:44,288 INFO L225 Difference]: With dead ends: 120284 [2024-11-11 22:47:44,289 INFO L226 Difference]: Without dead ends: 109786 [2024-11-11 22:47:44,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:47:44,336 INFO L435 NwaCegarLoop]: 1668 mSDtfsCounter, 9868 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9868 SdHoareTripleChecker+Valid, 4656 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:44,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9868 Valid, 4656 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:47:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109786 states. [2024-11-11 22:47:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109786 to 29964. [2024-11-11 22:47:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29964 states, 29962 states have (on average 1.4452973766771244) internal successors, (43304), 29963 states have internal predecessors, (43304), 0 states have call successors, (0), 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-11-11 22:47:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29964 states to 29964 states and 43304 transitions. [2024-11-11 22:47:46,012 INFO L78 Accepts]: Start accepts. Automaton has 29964 states and 43304 transitions. Word has length 104 [2024-11-11 22:47:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:46,020 INFO L471 AbstractCegarLoop]: Abstraction has 29964 states and 43304 transitions. [2024-11-11 22:47:46,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 22:47:46,020 INFO L276 IsEmpty]: Start isEmpty. Operand 29964 states and 43304 transitions. [2024-11-11 22:47:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:47:46,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:46,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:46,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:47:46,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:46,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1211718382, now seen corresponding path program 1 times [2024-11-11 22:47:46,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:46,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945774531] [2024-11-11 22:47:46,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:46,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:47:46,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:46,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945774531] [2024-11-11 22:47:46,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945774531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:46,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:46,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:47:46,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064399912] [2024-11-11 22:47:46,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:46,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:47:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:47:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:47:46,599 INFO L87 Difference]: Start difference. First operand 29964 states and 43304 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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-11-11 22:47:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:49,271 INFO L93 Difference]: Finished difference Result 135196 states and 194992 transitions. [2024-11-11 22:47:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:47:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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 104 [2024-11-11 22:47:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:49,506 INFO L225 Difference]: With dead ends: 135196 [2024-11-11 22:47:49,507 INFO L226 Difference]: Without dead ends: 120282 [2024-11-11 22:47:49,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:47:49,555 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 9870 mSDsluCounter, 2944 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9870 SdHoareTripleChecker+Valid, 4611 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:49,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9870 Valid, 4611 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:47:49,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120282 states. [2024-11-11 22:47:51,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120282 to 50124. [2024-11-11 22:47:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50124 states, 50122 states have (on average 1.437293005067635) internal successors, (72040), 50123 states have internal predecessors, (72040), 0 states have call successors, (0), 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-11-11 22:47:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50124 states to 50124 states and 72040 transitions. [2024-11-11 22:47:51,794 INFO L78 Accepts]: Start accepts. Automaton has 50124 states and 72040 transitions. Word has length 104 [2024-11-11 22:47:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:51,795 INFO L471 AbstractCegarLoop]: Abstraction has 50124 states and 72040 transitions. [2024-11-11 22:47:51,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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-11-11 22:47:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 50124 states and 72040 transitions. [2024-11-11 22:47:51,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:47:51,806 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:51,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:51,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:47:51,807 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:51,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:51,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1374632942, now seen corresponding path program 1 times [2024-11-11 22:47:51,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:51,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106703293] [2024-11-11 22:47:51,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 22:47:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:52,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106703293] [2024-11-11 22:47:52,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106703293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:52,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:52,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:47:52,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572115694] [2024-11-11 22:47:52,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:52,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:47:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:47:52,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:47:52,105 INFO L87 Difference]: Start difference. First operand 50124 states and 72040 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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-11-11 22:47:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:47:55,418 INFO L93 Difference]: Finished difference Result 150108 states and 216304 transitions. [2024-11-11 22:47:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:47:55,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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 104 [2024-11-11 22:47:55,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:47:55,620 INFO L225 Difference]: With dead ends: 150108 [2024-11-11 22:47:55,621 INFO L226 Difference]: Without dead ends: 135194 [2024-11-11 22:47:55,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:47:55,662 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 9892 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9892 SdHoareTripleChecker+Valid, 4545 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:47:55,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9892 Valid, 4545 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 22:47:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135194 states. [2024-11-11 22:47:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135194 to 65036. [2024-11-11 22:47:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65036 states, 65034 states have (on average 1.4354337731032998) internal successors, (93352), 65035 states have internal predecessors, (93352), 0 states have call successors, (0), 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-11-11 22:47:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65036 states to 65036 states and 93352 transitions. [2024-11-11 22:47:58,234 INFO L78 Accepts]: Start accepts. Automaton has 65036 states and 93352 transitions. Word has length 104 [2024-11-11 22:47:58,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:47:58,237 INFO L471 AbstractCegarLoop]: Abstraction has 65036 states and 93352 transitions. [2024-11-11 22:47:58,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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-11-11 22:47:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 65036 states and 93352 transitions. [2024-11-11 22:47:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:47:58,246 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:47:58,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:47:58,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:47:58,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:47:58,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:47:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1638489326, now seen corresponding path program 1 times [2024-11-11 22:47:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:47:58,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530627052] [2024-11-11 22:47:58,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:47:58,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:47:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:47:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 22:47:58,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:47:58,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530627052] [2024-11-11 22:47:58,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530627052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:47:58,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:47:58,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:47:58,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446272254] [2024-11-11 22:47:58,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:47:58,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:47:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:47:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:47:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:47:58,509 INFO L87 Difference]: Start difference. First operand 65036 states and 93352 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-11-11 22:48:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:02,525 INFO L93 Difference]: Finished difference Result 165020 states and 237616 transitions. [2024-11-11 22:48:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:02,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 104 [2024-11-11 22:48:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:02,821 INFO L225 Difference]: With dead ends: 165020 [2024-11-11 22:48:02,821 INFO L226 Difference]: Without dead ends: 150106 [2024-11-11 22:48:02,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:48:02,872 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 9980 mSDsluCounter, 2847 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9980 SdHoareTripleChecker+Valid, 4510 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:02,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9980 Valid, 4510 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:48:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150106 states. [2024-11-11 22:48:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150106 to 79948. [2024-11-11 22:48:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79948 states, 79946 states have (on average 1.434268130988417) internal successors, (114664), 79947 states have internal predecessors, (114664), 0 states have call successors, (0), 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-11-11 22:48:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79948 states to 79948 states and 114664 transitions. [2024-11-11 22:48:06,201 INFO L78 Accepts]: Start accepts. Automaton has 79948 states and 114664 transitions. Word has length 104 [2024-11-11 22:48:06,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:06,201 INFO L471 AbstractCegarLoop]: Abstraction has 79948 states and 114664 transitions. [2024-11-11 22:48:06,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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-11-11 22:48:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 79948 states and 114664 transitions. [2024-11-11 22:48:06,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:48:06,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:06,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:48:06,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:48:06,212 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:06,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash 661282542, now seen corresponding path program 1 times [2024-11-11 22:48:06,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120369839] [2024-11-11 22:48:06,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 22:48:06,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:06,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120369839] [2024-11-11 22:48:06,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120369839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:06,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:06,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063834543] [2024-11-11 22:48:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:06,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:06,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:06,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:06,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:06,443 INFO L87 Difference]: Start difference. First operand 79948 states and 114664 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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-11-11 22:48:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:48:11,053 INFO L93 Difference]: Finished difference Result 179932 states and 258928 transitions. [2024-11-11 22:48:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:48:11,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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 104 [2024-11-11 22:48:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:48:11,331 INFO L225 Difference]: With dead ends: 179932 [2024-11-11 22:48:11,331 INFO L226 Difference]: Without dead ends: 165018 [2024-11-11 22:48:11,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:48:11,374 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 10065 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10065 SdHoareTripleChecker+Valid, 4548 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:48:11,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10065 Valid, 4548 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 22:48:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165018 states. [2024-11-11 22:48:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165018 to 94860. [2024-11-11 22:48:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94860 states, 94858 states have (on average 1.4334689746779397) internal successors, (135976), 94859 states have internal predecessors, (135976), 0 states have call successors, (0), 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-11-11 22:48:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94860 states to 94860 states and 135976 transitions. [2024-11-11 22:48:15,098 INFO L78 Accepts]: Start accepts. Automaton has 94860 states and 135976 transitions. Word has length 104 [2024-11-11 22:48:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:48:15,098 INFO L471 AbstractCegarLoop]: Abstraction has 94860 states and 135976 transitions. [2024-11-11 22:48:15,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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-11-11 22:48:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 94860 states and 135976 transitions. [2024-11-11 22:48:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 22:48:15,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:48:15,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:48:15,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:48:15,108 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:48:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:48:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1852751890, now seen corresponding path program 1 times [2024-11-11 22:48:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:48:15,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72294266] [2024-11-11 22:48:15,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:48:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:48:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:48:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 22:48:15,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:48:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72294266] [2024-11-11 22:48:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72294266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:48:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:48:15,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:48:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112062744] [2024-11-11 22:48:15,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:48:15,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:48:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:48:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:48:15,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:48:15,337 INFO L87 Difference]: Start difference. First operand 94860 states and 135976 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 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)