./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.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 7c2a5ace26f36583b09a306c2edaa0573f422d931cc3959f8aefc935152706cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:30:26,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:30:26,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:30:26,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:30:26,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:30:26,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:30:26,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:30:26,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:30:26,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:30:26,240 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:30:26,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:30:26,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:30:26,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:30:26,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:30:26,244 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:30:26,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:30:26,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:30:26,245 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:30:26,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:30:26,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:30:26,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:30:26,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:30:26,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:30:26,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:30:26,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:30:26,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:30:26,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:30:26,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:30:26,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:30:26,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:30:26,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:30:26,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:30:26,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:30:26,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:30:26,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:30:26,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:30:26,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:30:26,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:30:26,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:30:26,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:30:26,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:30:26,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:30:26,253 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 -> 7c2a5ace26f36583b09a306c2edaa0573f422d931cc3959f8aefc935152706cf [2024-10-13 23:30:26,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:30:26,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:30:26,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:30:26,527 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:30:26,527 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:30:26,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c [2024-10-13 23:30:27,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:30:28,354 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:30:28,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c [2024-10-13 23:30:28,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086ef993e/ef5d3f24e5a04ff6912f3924f5afe936/FLAG5f2a31998 [2024-10-13 23:30:28,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/086ef993e/ef5d3f24e5a04ff6912f3924f5afe936 [2024-10-13 23:30:28,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:30:28,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:30:28,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:30:28,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:30:28,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:30:28,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:30:28" (1/1) ... [2024-10-13 23:30:28,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f7df12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:28, skipping insertion in model container [2024-10-13 23:30:28,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:30:28" (1/1) ... [2024-10-13 23:30:28,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:30:28,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c[5009,5022] [2024-10-13 23:30:29,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:30:29,647 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:30:29,673 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label11.c[5009,5022] [2024-10-13 23:30:30,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:30:30,107 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:30:30,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30 WrapperNode [2024-10-13 23:30:30,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:30:30,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:30:30,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:30:30,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:30:30,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,535 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-13 23:30:30,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:30:30,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:30:30,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:30:30,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:30:30,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,738 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:30:30,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:30,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:31,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:31,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:30:31,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:30:31,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:30:31,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:30:31,086 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (1/1) ... [2024-10-13 23:30:31,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:30:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:30:31,119 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-10-13 23:30:31,123 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-10-13 23:30:31,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:30:31,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:30:31,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:30:31,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:30:31,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:30:31,229 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:30:35,457 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-13 23:30:35,457 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:30:35,539 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:30:35,543 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:30:35,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:30:35 BoogieIcfgContainer [2024-10-13 23:30:35,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:30:35,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:30:35,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:30:35,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:30:35,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:30:28" (1/3) ... [2024-10-13 23:30:35,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17743998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:30:35, skipping insertion in model container [2024-10-13 23:30:35,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:30:30" (2/3) ... [2024-10-13 23:30:35,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17743998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:30:35, skipping insertion in model container [2024-10-13 23:30:35,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:30:35" (3/3) ... [2024-10-13 23:30:35,555 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label11.c [2024-10-13 23:30:35,604 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:30:35,605 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:30:35,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:30:35,709 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;@9c73a2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:30:35,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:30:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 23:30:35,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:35,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:35,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:35,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1237556607, now seen corresponding path program 1 times [2024-10-13 23:30:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595392957] [2024-10-13 23:30:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:30:35,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595392957] [2024-10-13 23:30:35,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595392957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:35,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:35,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:30:35,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910505214] [2024-10-13 23:30:35,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:35,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:30:35,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:30:35,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:30:35,955 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:36,043 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-13 23:30:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:30:36,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-13 23:30:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:36,067 INFO L225 Difference]: With dead ends: 1511 [2024-10-13 23:30:36,067 INFO L226 Difference]: Without dead ends: 754 [2024-10-13 23:30:36,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:30:36,077 INFO L432 NwaCegarLoop]: 1438 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:36,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:30:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-13 23:30:36,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-13 23:30:36,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-13 23:30:36,162 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 38 [2024-10-13 23:30:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:36,163 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-13 23:30:36,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-13 23:30:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 23:30:36,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:36,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:30:36,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:36,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2147299954, now seen corresponding path program 1 times [2024-10-13 23:30:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719156317] [2024-10-13 23:30:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:36,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:30:36,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:36,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719156317] [2024-10-13 23:30:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719156317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:36,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:36,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:30:36,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019947220] [2024-10-13 23:30:36,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:36,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:36,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:36,371 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:39,975 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-13 23:30:39,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:39,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-13 23:30:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:39,983 INFO L225 Difference]: With dead ends: 2258 [2024-10-13 23:30:39,984 INFO L226 Difference]: Without dead ends: 1505 [2024-10-13 23:30:39,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:39,986 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 754 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 704 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 704 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:39,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 84 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [704 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 23:30:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-13 23:30:40,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-13 23:30:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.8663563829787233) internal successors, (2807), 1504 states have internal predecessors, (2807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2807 transitions. [2024-10-13 23:30:40,038 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2807 transitions. Word has length 38 [2024-10-13 23:30:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:40,038 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2807 transitions. [2024-10-13 23:30:40,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2807 transitions. [2024-10-13 23:30:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 23:30:40,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:40,041 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:40,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:30:40,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:40,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:40,043 INFO L85 PathProgramCache]: Analyzing trace with hash -309817101, now seen corresponding path program 1 times [2024-10-13 23:30:40,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:40,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394293557] [2024-10-13 23:30:40,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:40,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:30:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394293557] [2024-10-13 23:30:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394293557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232693654] [2024-10-13 23:30:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:40,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:30:40,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:30:40,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:30:40,338 INFO L87 Difference]: Start difference. First operand 1505 states and 2807 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 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-10-13 23:30:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:44,865 INFO L93 Difference]: Finished difference Result 5270 states and 9795 transitions. [2024-10-13 23:30:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 23:30:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 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 103 [2024-10-13 23:30:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:44,879 INFO L225 Difference]: With dead ends: 5270 [2024-10-13 23:30:44,880 INFO L226 Difference]: Without dead ends: 3766 [2024-10-13 23:30:44,883 INFO L431 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-10-13 23:30:44,884 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 2309 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 1529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2309 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 5142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1529 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:44,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2309 Valid, 197 Invalid, 5142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1529 Valid, 3613 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 23:30:44,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2024-10-13 23:30:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3758. [2024-10-13 23:30:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.6055363321799307) internal successors, (6032), 3757 states have internal predecessors, (6032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 6032 transitions. [2024-10-13 23:30:44,955 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 6032 transitions. Word has length 103 [2024-10-13 23:30:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:44,957 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 6032 transitions. [2024-10-13 23:30:44,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 3 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-10-13 23:30:44,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 6032 transitions. [2024-10-13 23:30:44,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 23:30:44,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:44,969 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:44,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:30:44,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:44,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1577940646, now seen corresponding path program 1 times [2024-10-13 23:30:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438371611] [2024-10-13 23:30:44,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:44,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 23:30:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438371611] [2024-10-13 23:30:45,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438371611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:45,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:45,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:45,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577810556] [2024-10-13 23:30:45,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:45,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:30:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:30:45,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:30:45,439 INFO L87 Difference]: Start difference. First operand 3758 states and 6032 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:48,742 INFO L93 Difference]: Finished difference Result 10558 states and 17374 transitions. [2024-10-13 23:30:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:30:48,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 199 [2024-10-13 23:30:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:48,766 INFO L225 Difference]: With dead ends: 10558 [2024-10-13 23:30:48,766 INFO L226 Difference]: Without dead ends: 6764 [2024-10-13 23:30:48,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:30:48,774 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 704 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3110 mSolverCounterSat, 728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 3838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 728 IncrementalHoareTripleChecker+Valid, 3110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:48,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 707 Invalid, 3838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [728 Valid, 3110 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 23:30:48,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2024-10-13 23:30:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 6762. [2024-10-13 23:30:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.3571956811122614) internal successors, (9176), 6761 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 9176 transitions. [2024-10-13 23:30:48,887 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 9176 transitions. Word has length 199 [2024-10-13 23:30:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:48,888 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 9176 transitions. [2024-10-13 23:30:48,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 9176 transitions. [2024-10-13 23:30:48,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-13 23:30:48,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:48,892 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:48,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:30:48,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 259980789, now seen corresponding path program 1 times [2024-10-13 23:30:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370760045] [2024-10-13 23:30:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-13 23:30:49,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:49,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370760045] [2024-10-13 23:30:49,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370760045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:49,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:49,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:30:49,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346886554] [2024-10-13 23:30:49,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:49,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:49,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:49,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:49,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:49,219 INFO L87 Difference]: Start difference. First operand 6762 states and 9176 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:51,940 INFO L93 Difference]: Finished difference Result 16529 states and 23477 transitions. [2024-10-13 23:30:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 269 [2024-10-13 23:30:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:51,973 INFO L225 Difference]: With dead ends: 16529 [2024-10-13 23:30:51,973 INFO L226 Difference]: Without dead ends: 9768 [2024-10-13 23:30:51,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:51,985 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:51,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 388 Invalid, 2810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:30:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9768 states. [2024-10-13 23:30:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9768 to 9766. [2024-10-13 23:30:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.3653865847414235) internal successors, (13333), 9765 states have internal predecessors, (13333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 13333 transitions. [2024-10-13 23:30:52,161 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 13333 transitions. Word has length 269 [2024-10-13 23:30:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:52,163 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 13333 transitions. [2024-10-13 23:30:52,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 13333 transitions. [2024-10-13 23:30:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-10-13 23:30:52,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:52,171 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:52,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:30:52,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:52,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1324441019, now seen corresponding path program 1 times [2024-10-13 23:30:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609406748] [2024-10-13 23:30:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:52,443 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-10-13 23:30:52,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:52,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609406748] [2024-10-13 23:30:52,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609406748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:52,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:52,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:30:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123935552] [2024-10-13 23:30:52,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:52,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:52,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:52,446 INFO L87 Difference]: Start difference. First operand 9766 states and 13333 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:55,107 INFO L93 Difference]: Finished difference Result 27041 states and 37584 transitions. [2024-10-13 23:30:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:55,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 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 301 [2024-10-13 23:30:55,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:55,155 INFO L225 Difference]: With dead ends: 27041 [2024-10-13 23:30:55,156 INFO L226 Difference]: Without dead ends: 17276 [2024-10-13 23:30:55,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:55,174 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:55,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 425 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:30:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17276 states. [2024-10-13 23:30:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17276 to 15774. [2024-10-13 23:30:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.2816204907119761) internal successors, (20215), 15773 states have internal predecessors, (20215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 20215 transitions. [2024-10-13 23:30:55,410 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 20215 transitions. Word has length 301 [2024-10-13 23:30:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:55,412 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 20215 transitions. [2024-10-13 23:30:55,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 20215 transitions. [2024-10-13 23:30:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-10-13 23:30:55,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:55,419 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:30:55,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:30:55,420 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:55,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -380513429, now seen corresponding path program 1 times [2024-10-13 23:30:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:55,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744269461] [2024-10-13 23:30:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-13 23:30:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744269461] [2024-10-13 23:30:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744269461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:56,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:56,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:56,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723590869] [2024-10-13 23:30:56,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:56,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:56,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:56,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:56,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:56,134 INFO L87 Difference]: Start difference. First operand 15774 states and 20215 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:30:58,906 INFO L93 Difference]: Finished difference Result 39808 states and 52169 transitions. [2024-10-13 23:30:58,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:30:58,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 380 [2024-10-13 23:30:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:30:58,956 INFO L225 Difference]: With dead ends: 39808 [2024-10-13 23:30:58,956 INFO L226 Difference]: Without dead ends: 24035 [2024-10-13 23:30:58,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:58,980 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 775 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 1093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1093 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:30:58,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 140 Invalid, 3131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1093 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:30:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2024-10-13 23:30:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 23284. [2024-10-13 23:30:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23284 states, 23283 states have (on average 1.3032684791478761) internal successors, (30344), 23283 states have internal predecessors, (30344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 30344 transitions. [2024-10-13 23:30:59,378 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 30344 transitions. Word has length 380 [2024-10-13 23:30:59,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:30:59,379 INFO L471 AbstractCegarLoop]: Abstraction has 23284 states and 30344 transitions. [2024-10-13 23:30:59,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:30:59,379 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 30344 transitions. [2024-10-13 23:30:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-10-13 23:30:59,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:30:59,387 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:30:59,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:30:59,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:30:59,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:30:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1534073490, now seen corresponding path program 1 times [2024-10-13 23:30:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:30:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726296277] [2024-10-13 23:30:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:30:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:30:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:30:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-13 23:30:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:30:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726296277] [2024-10-13 23:30:59,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726296277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:30:59,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:30:59,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:30:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331240975] [2024-10-13 23:30:59,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:30:59,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:30:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:30:59,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:30:59,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:30:59,636 INFO L87 Difference]: Start difference. First operand 23284 states and 30344 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:02,366 INFO L93 Difference]: Finished difference Result 57081 states and 74477 transitions. [2024-10-13 23:31:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 397 [2024-10-13 23:31:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:02,420 INFO L225 Difference]: With dead ends: 57081 [2024-10-13 23:31:02,420 INFO L226 Difference]: Without dead ends: 33798 [2024-10-13 23:31:02,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:02,447 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 733 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 3030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:02,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 215 Invalid, 3030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:31:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33798 states. [2024-10-13 23:31:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33798 to 33047. [2024-10-13 23:31:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33047 states, 33046 states have (on average 1.2908067542213884) internal successors, (42656), 33046 states have internal predecessors, (42656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33047 states to 33047 states and 42656 transitions. [2024-10-13 23:31:02,944 INFO L78 Accepts]: Start accepts. Automaton has 33047 states and 42656 transitions. Word has length 397 [2024-10-13 23:31:02,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:02,945 INFO L471 AbstractCegarLoop]: Abstraction has 33047 states and 42656 transitions. [2024-10-13 23:31:02,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 33047 states and 42656 transitions. [2024-10-13 23:31:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-10-13 23:31:02,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:02,959 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:31:02,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:31:02,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:02,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:02,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1182919860, now seen corresponding path program 1 times [2024-10-13 23:31:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854280449] [2024-10-13 23:31:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-13 23:31:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:03,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854280449] [2024-10-13 23:31:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854280449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:03,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:31:03,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:31:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093266268] [2024-10-13 23:31:03,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:03,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:03,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:03,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:03,209 INFO L87 Difference]: Start difference. First operand 33047 states and 42656 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:06,203 INFO L93 Difference]: Finished difference Result 89374 states and 116904 transitions. [2024-10-13 23:31:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:06,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 408 [2024-10-13 23:31:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:06,290 INFO L225 Difference]: With dead ends: 89374 [2024-10-13 23:31:06,290 INFO L226 Difference]: Without dead ends: 56328 [2024-10-13 23:31:06,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:06,321 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 719 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:06,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 419 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 23:31:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56328 states. [2024-10-13 23:31:06,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56328 to 54826. [2024-10-13 23:31:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54826 states, 54825 states have (on average 1.2623620611035111) internal successors, (69209), 54825 states have internal predecessors, (69209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:06,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54826 states to 54826 states and 69209 transitions. [2024-10-13 23:31:06,939 INFO L78 Accepts]: Start accepts. Automaton has 54826 states and 69209 transitions. Word has length 408 [2024-10-13 23:31:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:06,940 INFO L471 AbstractCegarLoop]: Abstraction has 54826 states and 69209 transitions. [2024-10-13 23:31:06,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 54826 states and 69209 transitions. [2024-10-13 23:31:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2024-10-13 23:31:06,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:06,949 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:31:06,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:31:06,949 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:06,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash -760687584, now seen corresponding path program 1 times [2024-10-13 23:31:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:06,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686898374] [2024-10-13 23:31:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:06,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 23:31:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686898374] [2024-10-13 23:31:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686898374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:07,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:31:07,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:31:07,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632766847] [2024-10-13 23:31:07,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:07,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:07,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:07,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:07,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:07,381 INFO L87 Difference]: Start difference. First operand 54826 states and 69209 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:10,052 INFO L93 Difference]: Finished difference Result 134434 states and 169112 transitions. [2024-10-13 23:31:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 422 [2024-10-13 23:31:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:10,141 INFO L225 Difference]: With dead ends: 134434 [2024-10-13 23:31:10,141 INFO L226 Difference]: Without dead ends: 79609 [2024-10-13 23:31:10,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:10,188 INFO L432 NwaCegarLoop]: 1329 mSDtfsCounter, 663 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 532 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:10,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1336 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [532 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:31:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79609 states. [2024-10-13 23:31:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79609 to 75854. [2024-10-13 23:31:11,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75854 states, 75853 states have (on average 1.2253964905804648) internal successors, (92950), 75853 states have internal predecessors, (92950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75854 states to 75854 states and 92950 transitions. [2024-10-13 23:31:11,113 INFO L78 Accepts]: Start accepts. Automaton has 75854 states and 92950 transitions. Word has length 422 [2024-10-13 23:31:11,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:11,114 INFO L471 AbstractCegarLoop]: Abstraction has 75854 states and 92950 transitions. [2024-10-13 23:31:11,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:11,115 INFO L276 IsEmpty]: Start isEmpty. Operand 75854 states and 92950 transitions. [2024-10-13 23:31:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-10-13 23:31:11,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:11,123 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:31:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:31:11,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1878812254, now seen corresponding path program 1 times [2024-10-13 23:31:11,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839692742] [2024-10-13 23:31:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 23:31:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839692742] [2024-10-13 23:31:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839692742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:12,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:31:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:31:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537892189] [2024-10-13 23:31:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:12,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:12,265 INFO L87 Difference]: Start difference. First operand 75854 states and 92950 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:15,018 INFO L93 Difference]: Finished difference Result 164474 states and 200518 transitions. [2024-10-13 23:31:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:15,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 434 [2024-10-13 23:31:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:15,141 INFO L225 Difference]: With dead ends: 164474 [2024-10-13 23:31:15,142 INFO L226 Difference]: Without dead ends: 88621 [2024-10-13 23:31:15,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:15,160 INFO L432 NwaCegarLoop]: 901 mSDtfsCounter, 805 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2139 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:15,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 907 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2139 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:31:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88621 states. [2024-10-13 23:31:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88621 to 84866. [2024-10-13 23:31:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84866 states, 84865 states have (on average 1.1808048076356565) internal successors, (100209), 84865 states have internal predecessors, (100209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84866 states to 84866 states and 100209 transitions. [2024-10-13 23:31:16,448 INFO L78 Accepts]: Start accepts. Automaton has 84866 states and 100209 transitions. Word has length 434 [2024-10-13 23:31:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:16,449 INFO L471 AbstractCegarLoop]: Abstraction has 84866 states and 100209 transitions. [2024-10-13 23:31:16,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 84866 states and 100209 transitions. [2024-10-13 23:31:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-10-13 23:31:16,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:16,472 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:31:16,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:31:16,473 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:16,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1523740588, now seen corresponding path program 1 times [2024-10-13 23:31:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356291478] [2024-10-13 23:31:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:17,092 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-13 23:31:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356291478] [2024-10-13 23:31:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356291478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:31:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:31:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488855098] [2024-10-13 23:31:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:17,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:17,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:17,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:17,094 INFO L87 Difference]: Start difference. First operand 84866 states and 100209 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:20,257 INFO L93 Difference]: Finished difference Result 198269 states and 234748 transitions. [2024-10-13 23:31:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 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 437 [2024-10-13 23:31:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:20,408 INFO L225 Difference]: With dead ends: 198269 [2024-10-13 23:31:20,408 INFO L226 Difference]: Without dead ends: 113404 [2024-10-13 23:31:20,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:20,637 INFO L432 NwaCegarLoop]: 1257 mSDtfsCounter, 694 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:20,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1264 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:31:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113404 states. [2024-10-13 23:31:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113404 to 102890. [2024-10-13 23:31:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102890 states, 102889 states have (on average 1.1585203471702514) internal successors, (119199), 102889 states have internal predecessors, (119199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102890 states to 102890 states and 119199 transitions. [2024-10-13 23:31:21,700 INFO L78 Accepts]: Start accepts. Automaton has 102890 states and 119199 transitions. Word has length 437 [2024-10-13 23:31:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:21,700 INFO L471 AbstractCegarLoop]: Abstraction has 102890 states and 119199 transitions. [2024-10-13 23:31:21,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 102890 states and 119199 transitions. [2024-10-13 23:31:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-10-13 23:31:21,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:21,711 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:31:21,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:31:21,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:21,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 208469600, now seen corresponding path program 1 times [2024-10-13 23:31:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:21,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591108872] [2024-10-13 23:31:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:21,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-13 23:31:22,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:22,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591108872] [2024-10-13 23:31:22,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591108872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:22,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:31:22,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:31:22,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840195277] [2024-10-13 23:31:22,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:22,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:22,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:22,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:22,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:22,429 INFO L87 Difference]: Start difference. First operand 102890 states and 119199 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:25,325 INFO L93 Difference]: Finished difference Result 208032 states and 240665 transitions. [2024-10-13 23:31:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:25,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 478 [2024-10-13 23:31:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:25,450 INFO L225 Difference]: With dead ends: 208032 [2024-10-13 23:31:25,450 INFO L226 Difference]: Without dead ends: 105143 [2024-10-13 23:31:25,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:25,511 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 680 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:25,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 218 Invalid, 2664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:31:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105143 states. [2024-10-13 23:31:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105143 to 102139. [2024-10-13 23:31:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102139 states, 102138 states have (on average 1.1215316532534414) internal successors, (114551), 102138 states have internal predecessors, (114551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102139 states to 102139 states and 114551 transitions. [2024-10-13 23:31:26,813 INFO L78 Accepts]: Start accepts. Automaton has 102139 states and 114551 transitions. Word has length 478 [2024-10-13 23:31:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:26,813 INFO L471 AbstractCegarLoop]: Abstraction has 102139 states and 114551 transitions. [2024-10-13 23:31:26,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 102139 states and 114551 transitions. [2024-10-13 23:31:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-10-13 23:31:26,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:26,821 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:31:26,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:31:26,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:26,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1068174179, now seen corresponding path program 1 times [2024-10-13 23:31:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333181983] [2024-10-13 23:31:26,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 23:31:27,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333181983] [2024-10-13 23:31:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333181983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:27,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:31:27,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:31:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290772327] [2024-10-13 23:31:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:27,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:27,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:27,634 INFO L87 Difference]: Start difference. First operand 102139 states and 114551 transitions. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:30,577 INFO L93 Difference]: Finished difference Result 204277 states and 229101 transitions. [2024-10-13 23:31:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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 500 [2024-10-13 23:31:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:30,696 INFO L225 Difference]: With dead ends: 204277 [2024-10-13 23:31:30,696 INFO L226 Difference]: Without dead ends: 102139 [2024-10-13 23:31:30,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:30,744 INFO L432 NwaCegarLoop]: 1274 mSDtfsCounter, 567 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:30,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1281 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:31:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102139 states. [2024-10-13 23:31:31,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102139 to 96131. [2024-10-13 23:31:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96131 states, 96130 states have (on average 1.0887652137730157) internal successors, (104663), 96130 states have internal predecessors, (104663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96131 states to 96131 states and 104663 transitions. [2024-10-13 23:31:32,098 INFO L78 Accepts]: Start accepts. Automaton has 96131 states and 104663 transitions. Word has length 500 [2024-10-13 23:31:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:32,099 INFO L471 AbstractCegarLoop]: Abstraction has 96131 states and 104663 transitions. [2024-10-13 23:31:32,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 96131 states and 104663 transitions. [2024-10-13 23:31:32,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2024-10-13 23:31:32,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:32,108 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:31:32,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:31:32,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:32,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2061863295, now seen corresponding path program 1 times [2024-10-13 23:31:32,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:32,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673053705] [2024-10-13 23:31:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-13 23:31:32,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:32,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673053705] [2024-10-13 23:31:32,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673053705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:32,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:31:32,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:31:32,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977837483] [2024-10-13 23:31:32,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:32,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:32,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:32,457 INFO L87 Difference]: Start difference. First operand 96131 states and 104663 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:35,409 INFO L93 Difference]: Finished difference Result 226807 states and 248396 transitions. [2024-10-13 23:31:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:35,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 515 [2024-10-13 23:31:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:35,562 INFO L225 Difference]: With dead ends: 226807 [2024-10-13 23:31:35,562 INFO L226 Difference]: Without dead ends: 130677 [2024-10-13 23:31:35,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:35,628 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 658 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:35,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 248 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:31:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130677 states. [2024-10-13 23:31:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130677 to 129175. [2024-10-13 23:31:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129175 states, 129174 states have (on average 1.0863950949881556) internal successors, (140334), 129174 states have internal predecessors, (140334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129175 states to 129175 states and 140334 transitions. [2024-10-13 23:31:37,584 INFO L78 Accepts]: Start accepts. Automaton has 129175 states and 140334 transitions. Word has length 515 [2024-10-13 23:31:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:37,584 INFO L471 AbstractCegarLoop]: Abstraction has 129175 states and 140334 transitions. [2024-10-13 23:31:37,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 129175 states and 140334 transitions. [2024-10-13 23:31:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2024-10-13 23:31:37,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:37,590 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:31:37,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:31:37,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:37,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash 36059188, now seen corresponding path program 1 times [2024-10-13 23:31:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991498015] [2024-10-13 23:31:37,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:31:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-13 23:31:37,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:31:37,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991498015] [2024-10-13 23:31:37,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991498015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:31:37,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:31:37,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:31:37,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373269925] [2024-10-13 23:31:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:31:37,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:31:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:31:37,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:31:37,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:37,796 INFO L87 Difference]: Start difference. First operand 129175 states and 140334 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:31:40,770 INFO L93 Difference]: Finished difference Result 277124 states and 301306 transitions. [2024-10-13 23:31:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:31:40,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 518 [2024-10-13 23:31:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:31:40,954 INFO L225 Difference]: With dead ends: 277124 [2024-10-13 23:31:40,954 INFO L226 Difference]: Without dead ends: 147950 [2024-10-13 23:31:41,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:31:41,028 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 835 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:31:41,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1114 Invalid, 2601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:31:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147950 states. [2024-10-13 23:31:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147950 to 145697. [2024-10-13 23:31:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145697 states, 145696 states have (on average 1.0808807379749616) internal successors, (157480), 145696 states have internal predecessors, (157480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145697 states to 145697 states and 157480 transitions. [2024-10-13 23:31:43,283 INFO L78 Accepts]: Start accepts. Automaton has 145697 states and 157480 transitions. Word has length 518 [2024-10-13 23:31:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:31:43,283 INFO L471 AbstractCegarLoop]: Abstraction has 145697 states and 157480 transitions. [2024-10-13 23:31:43,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:31:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 145697 states and 157480 transitions. [2024-10-13 23:31:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2024-10-13 23:31:43,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:31:43,294 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:31:43,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:31:43,295 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:31:43,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:31:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash 442234795, now seen corresponding path program 1 times [2024-10-13 23:31:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:31:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372558788] [2024-10-13 23:31:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:31:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:31:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat