./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label48.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d929df4a838f03b0a70e3f4a24ac63ec6782a4f298757e5a2174a7cc8e9071c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:48:55,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:48:55,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:48:55,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:48:55,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:48:55,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:48:55,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:48:55,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:48:55,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:48:55,764 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:48:55,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:48:55,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:48:55,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:48:55,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:48:55,768 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:48:55,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:48:55,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:48:55,769 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:48:55,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:48:55,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:48:55,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:48:55,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:48:55,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:48:55,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:48:55,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:48:55,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:48:55,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:48:55,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:48:55,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:48:55,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:48:55,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:48:55,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:48:55,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:48:55,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:48:55,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:48:55,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:48:55,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:48:55,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:48:55,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:48:55,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:48:55,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:48:55,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:48:55,776 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d929df4a838f03b0a70e3f4a24ac63ec6782a4f298757e5a2174a7cc8e9071c [2024-10-10 23:48:56,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:48:56,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:48:56,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:48:56,064 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:48:56,064 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:48:56,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label48.c [2024-10-10 23:48:57,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:48:57,922 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:48:57,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label48.c [2024-10-10 23:48:57,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/faab4d6f4/2a1cdc1de5ed4ff2bfa2b53b16848e0a/FLAG1dddf977b [2024-10-10 23:48:58,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/faab4d6f4/2a1cdc1de5ed4ff2bfa2b53b16848e0a [2024-10-10 23:48:58,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:48:58,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:48:58,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:48:58,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:48:58,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:48:58,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:48:58" (1/1) ... [2024-10-10 23:48:58,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f41a3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:58, skipping insertion in model container [2024-10-10 23:48:58,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:48:58" (1/1) ... [2024-10-10 23:48:58,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:48:58,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label48.c[6493,6506] [2024-10-10 23:48:59,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:48:59,046 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:48:59,073 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label48.c[6493,6506] [2024-10-10 23:48:59,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:48:59,310 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:48:59,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59 WrapperNode [2024-10-10 23:48:59,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:48:59,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:48:59,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:48:59,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:48:59,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:48:59,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:48:59,588 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-10 23:48:59,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:48:59,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:48:59,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:48:59,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:48:59,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:48:59,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:48:59,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:48:59,922 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:48:59,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:48:59,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:49:00,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:49:00,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:49:00,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:49:00,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:49:00,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:49:00,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:49:00,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:49:00,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:49:00,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (1/1) ... [2024-10-10 23:49:00,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:49:00,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:00,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:49:00,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:49:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:49:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:49:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:49:00,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:49:00,402 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:49:00,404 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:49:03,583 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-10 23:49:03,584 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:49:03,662 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:49:03,663 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:49:03,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:49:03 BoogieIcfgContainer [2024-10-10 23:49:03,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:49:03,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:49:03,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:49:03,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:49:03,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:48:58" (1/3) ... [2024-10-10 23:49:03,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d4ea07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:49:03, skipping insertion in model container [2024-10-10 23:49:03,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:48:59" (2/3) ... [2024-10-10 23:49:03,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d4ea07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:49:03, skipping insertion in model container [2024-10-10 23:49:03,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:49:03" (3/3) ... [2024-10-10 23:49:03,678 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label48.c [2024-10-10 23:49:03,695 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:49:03,696 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:49:03,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:49:03,797 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;@4dcda08d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:49:03,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:49:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 23:49:03,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:03,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:03,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:03,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:03,821 INFO L85 PathProgramCache]: Analyzing trace with hash -255333436, now seen corresponding path program 1 times [2024-10-10 23:49:03,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:03,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970534384] [2024-10-10 23:49:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:03,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970534384] [2024-10-10 23:49:04,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970534384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:04,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:04,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:04,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297422350] [2024-10-10 23:49:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:04,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:49:04,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:49:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:49:04,075 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:04,170 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-10 23:49:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:49:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-10 23:49:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:04,197 INFO L225 Difference]: With dead ends: 1055 [2024-10-10 23:49:04,197 INFO L226 Difference]: Without dead ends: 526 [2024-10-10 23:49:04,205 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-10 23:49:04,210 INFO L432 NwaCegarLoop]: 935 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, 935 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-10 23:49:04,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:49:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-10 23:49:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-10 23:49:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-10 23:49:04,298 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 42 [2024-10-10 23:49:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:04,299 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-10 23:49:04,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-10 23:49:04,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 23:49:04,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:04,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:04,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:49:04,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:04,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:04,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1355722073, now seen corresponding path program 1 times [2024-10-10 23:49:04,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:04,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796018193] [2024-10-10 23:49:04,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:04,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:04,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:04,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796018193] [2024-10-10 23:49:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796018193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:04,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:04,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546996575] [2024-10-10 23:49:04,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:04,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:04,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:04,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:04,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:04,499 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:06,664 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2024-10-10 23:49:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:06,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-10 23:49:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:06,670 INFO L225 Difference]: With dead ends: 1501 [2024-10-10 23:49:06,670 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:49:06,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:06,672 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 429 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:06,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 448 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:49:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:49:06,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2024-10-10 23:49:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2024-10-10 23:49:06,713 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 42 [2024-10-10 23:49:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:06,714 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2024-10-10 23:49:06,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2024-10-10 23:49:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-10 23:49:06,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:06,718 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, 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] [2024-10-10 23:49:06,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:49:06,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:06,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1399040878, now seen corresponding path program 1 times [2024-10-10 23:49:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645652921] [2024-10-10 23:49:06,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:06,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:06,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:06,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645652921] [2024-10-10 23:49:06,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645652921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:06,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:06,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:06,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815392341] [2024-10-10 23:49:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:06,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:06,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:06,947 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:08,949 INFO L93 Difference]: Finished difference Result 2814 states and 4381 transitions. [2024-10-10 23:49:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-10-10 23:49:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:08,958 INFO L225 Difference]: With dead ends: 2814 [2024-10-10 23:49:08,958 INFO L226 Difference]: Without dead ends: 1845 [2024-10-10 23:49:08,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:08,962 INFO L432 NwaCegarLoop]: 505 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:08,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 578 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:49:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2024-10-10 23:49:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1840. [2024-10-10 23:49:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3507340946166395) internal successors, (2484), 1839 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2484 transitions. [2024-10-10 23:49:09,000 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2484 transitions. Word has length 109 [2024-10-10 23:49:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:09,000 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2484 transitions. [2024-10-10 23:49:09,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2484 transitions. [2024-10-10 23:49:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-10 23:49:09,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:09,003 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, 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] [2024-10-10 23:49:09,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:49:09,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash 119554252, now seen corresponding path program 1 times [2024-10-10 23:49:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:09,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372490796] [2024-10-10 23:49:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:09,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:09,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372490796] [2024-10-10 23:49:09,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372490796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:09,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:09,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925305361] [2024-10-10 23:49:09,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:09,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:09,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:09,441 INFO L87 Difference]: Start difference. First operand 1840 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:12,771 INFO L93 Difference]: Finished difference Result 6766 states and 9262 transitions. [2024-10-10 23:49:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-10-10 23:49:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:12,791 INFO L225 Difference]: With dead ends: 6766 [2024-10-10 23:49:12,792 INFO L226 Difference]: Without dead ends: 4927 [2024-10-10 23:49:12,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:12,797 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 925 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:12,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 283 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 2517 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:49:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2024-10-10 23:49:12,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 4874. [2024-10-10 23:49:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.287092140365278) internal successors, (6272), 4873 states have internal predecessors, (6272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:12,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6272 transitions. [2024-10-10 23:49:12,899 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6272 transitions. Word has length 112 [2024-10-10 23:49:12,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 6272 transitions. [2024-10-10 23:49:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6272 transitions. [2024-10-10 23:49:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-10 23:49:12,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:12,908 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:49:12,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash 806678517, now seen corresponding path program 1 times [2024-10-10 23:49:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993868297] [2024-10-10 23:49:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:49:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993868297] [2024-10-10 23:49:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993868297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:13,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:13,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:13,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527505296] [2024-10-10 23:49:13,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:13,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:13,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:13,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:13,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:13,216 INFO L87 Difference]: Start difference. First operand 4874 states and 6272 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:14,884 INFO L93 Difference]: Finished difference Result 14435 states and 18549 transitions. [2024-10-10 23:49:14,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:14,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2024-10-10 23:49:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:14,913 INFO L225 Difference]: With dead ends: 14435 [2024-10-10 23:49:14,913 INFO L226 Difference]: Without dead ends: 8276 [2024-10-10 23:49:14,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:14,924 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:14,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:49:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2024-10-10 23:49:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6570. [2024-10-10 23:49:15,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6570 states, 6569 states have (on average 1.1796316029837113) internal successors, (7749), 6569 states have internal predecessors, (7749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6570 states to 6570 states and 7749 transitions. [2024-10-10 23:49:15,097 INFO L78 Accepts]: Start accepts. Automaton has 6570 states and 7749 transitions. Word has length 178 [2024-10-10 23:49:15,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:15,098 INFO L471 AbstractCegarLoop]: Abstraction has 6570 states and 7749 transitions. [2024-10-10 23:49:15,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6570 states and 7749 transitions. [2024-10-10 23:49:15,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-10 23:49:15,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:15,101 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:15,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:49:15,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:15,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1033672419, now seen corresponding path program 1 times [2024-10-10 23:49:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:15,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518839393] [2024-10-10 23:49:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518839393] [2024-10-10 23:49:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518839393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:15,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:15,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:15,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836051847] [2024-10-10 23:49:15,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:15,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:15,304 INFO L87 Difference]: Start difference. First operand 6570 states and 7749 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-10 23:49:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:16,832 INFO L93 Difference]: Finished difference Result 16549 states and 19924 transitions. [2024-10-10 23:49:16,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:16,833 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 191 [2024-10-10 23:49:16,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:16,869 INFO L225 Difference]: With dead ends: 16549 [2024-10-10 23:49:16,870 INFO L226 Difference]: Without dead ends: 9980 [2024-10-10 23:49:16,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:16,884 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 499 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:16,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 798 Invalid, 1549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:49:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9980 states. [2024-10-10 23:49:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9980 to 9980. [2024-10-10 23:49:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9980 states, 9979 states have (on average 1.1698566990680428) internal successors, (11674), 9979 states have internal predecessors, (11674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9980 states to 9980 states and 11674 transitions. [2024-10-10 23:49:17,128 INFO L78 Accepts]: Start accepts. Automaton has 9980 states and 11674 transitions. Word has length 191 [2024-10-10 23:49:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:17,131 INFO L471 AbstractCegarLoop]: Abstraction has 9980 states and 11674 transitions. [2024-10-10 23:49:17,132 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-10 23:49:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 9980 states and 11674 transitions. [2024-10-10 23:49:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-10 23:49:17,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:17,134 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:17,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:49:17,134 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:17,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash -857375653, now seen corresponding path program 1 times [2024-10-10 23:49:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:17,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113662959] [2024-10-10 23:49:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:49:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:17,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113662959] [2024-10-10 23:49:17,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113662959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:17,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:17,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416154490] [2024-10-10 23:49:17,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:17,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:17,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:17,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:17,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:17,372 INFO L87 Difference]: Start difference. First operand 9980 states and 11674 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:19,334 INFO L93 Difference]: Finished difference Result 24247 states and 28756 transitions. [2024-10-10 23:49:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 196 [2024-10-10 23:49:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:19,450 INFO L225 Difference]: With dead ends: 24247 [2024-10-10 23:49:19,450 INFO L226 Difference]: Without dead ends: 14268 [2024-10-10 23:49:19,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:19,467 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 476 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:19,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 442 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:49:19,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14268 states. [2024-10-10 23:49:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14268 to 13396. [2024-10-10 23:49:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13396 states, 13395 states have (on average 1.1923852183650616) internal successors, (15972), 13395 states have internal predecessors, (15972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13396 states to 13396 states and 15972 transitions. [2024-10-10 23:49:19,766 INFO L78 Accepts]: Start accepts. Automaton has 13396 states and 15972 transitions. Word has length 196 [2024-10-10 23:49:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:19,767 INFO L471 AbstractCegarLoop]: Abstraction has 13396 states and 15972 transitions. [2024-10-10 23:49:19,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 13396 states and 15972 transitions. [2024-10-10 23:49:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-10 23:49:19,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:19,772 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:49:19,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:19,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 864314517, now seen corresponding path program 1 times [2024-10-10 23:49:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672544810] [2024-10-10 23:49:19,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:19,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:49:20,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:20,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672544810] [2024-10-10 23:49:20,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672544810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:20,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:20,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:20,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446485361] [2024-10-10 23:49:20,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:20,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:20,024 INFO L87 Difference]: Start difference. First operand 13396 states and 15972 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:21,923 INFO L93 Difference]: Finished difference Result 30623 states and 36859 transitions. [2024-10-10 23:49:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:21,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 241 [2024-10-10 23:49:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:21,955 INFO L225 Difference]: With dead ends: 30623 [2024-10-10 23:49:21,955 INFO L226 Difference]: Without dead ends: 17228 [2024-10-10 23:49:21,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:21,974 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 459 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:21,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 408 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:49:21,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17228 states. [2024-10-10 23:49:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17228 to 13378. [2024-10-10 23:49:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13378 states, 13377 states have (on average 1.1906257008297825) internal successors, (15927), 13377 states have internal predecessors, (15927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13378 states to 13378 states and 15927 transitions. [2024-10-10 23:49:22,254 INFO L78 Accepts]: Start accepts. Automaton has 13378 states and 15927 transitions. Word has length 241 [2024-10-10 23:49:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:22,255 INFO L471 AbstractCegarLoop]: Abstraction has 13378 states and 15927 transitions. [2024-10-10 23:49:22,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 13378 states and 15927 transitions. [2024-10-10 23:49:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-10 23:49:22,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:22,260 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:22,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:49:22,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:22,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1438232309, now seen corresponding path program 1 times [2024-10-10 23:49:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:22,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297614387] [2024-10-10 23:49:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:49:22,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:22,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297614387] [2024-10-10 23:49:22,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297614387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:22,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:22,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303848200] [2024-10-10 23:49:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:22,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:22,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:22,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:22,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:22,543 INFO L87 Difference]: Start difference. First operand 13378 states and 15927 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:24,439 INFO L93 Difference]: Finished difference Result 30621 states and 36710 transitions. [2024-10-10 23:49:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2024-10-10 23:49:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:24,484 INFO L225 Difference]: With dead ends: 30621 [2024-10-10 23:49:24,485 INFO L226 Difference]: Without dead ends: 17244 [2024-10-10 23:49:24,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:24,507 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 356 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:24,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 884 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:49:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17244 states. [2024-10-10 23:49:24,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17244 to 16811. [2024-10-10 23:49:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16811 states, 16810 states have (on average 1.1727543129089828) internal successors, (19714), 16810 states have internal predecessors, (19714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16811 states to 16811 states and 19714 transitions. [2024-10-10 23:49:24,827 INFO L78 Accepts]: Start accepts. Automaton has 16811 states and 19714 transitions. Word has length 258 [2024-10-10 23:49:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:24,828 INFO L471 AbstractCegarLoop]: Abstraction has 16811 states and 19714 transitions. [2024-10-10 23:49:24,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16811 states and 19714 transitions. [2024-10-10 23:49:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-10 23:49:24,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:24,833 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:24,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:49:24,833 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:24,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 117388878, now seen corresponding path program 1 times [2024-10-10 23:49:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:24,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756998877] [2024-10-10 23:49:24,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 220 proven. 70 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-10 23:49:25,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756998877] [2024-10-10 23:49:25,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756998877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:25,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709968444] [2024-10-10 23:49:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:25,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:49:25,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:49:25,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:49:25,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:49:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:25,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 23:49:25,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:49:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 220 proven. 70 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-10 23:49:25,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:49:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-10 23:49:25,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709968444] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:49:25,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:49:25,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-10-10 23:49:25,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463159939] [2024-10-10 23:49:25,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:25,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:25,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:49:25,899 INFO L87 Difference]: Start difference. First operand 16811 states and 19714 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:28,750 INFO L93 Difference]: Finished difference Result 47274 states and 56055 transitions. [2024-10-10 23:49:28,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:28,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 266 [2024-10-10 23:49:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:28,794 INFO L225 Difference]: With dead ends: 47274 [2024-10-10 23:49:28,794 INFO L226 Difference]: Without dead ends: 28305 [2024-10-10 23:49:28,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:49:28,814 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 886 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 730 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 730 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:28,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 161 Invalid, 3021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [730 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:49:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28305 states. [2024-10-10 23:49:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28305 to 27874. [2024-10-10 23:49:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27874 states, 27873 states have (on average 1.1424676209952283) internal successors, (31844), 27873 states have internal predecessors, (31844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27874 states to 27874 states and 31844 transitions. [2024-10-10 23:49:29,138 INFO L78 Accepts]: Start accepts. Automaton has 27874 states and 31844 transitions. Word has length 266 [2024-10-10 23:49:29,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:29,138 INFO L471 AbstractCegarLoop]: Abstraction has 27874 states and 31844 transitions. [2024-10-10 23:49:29,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27874 states and 31844 transitions. [2024-10-10 23:49:29,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-10 23:49:29,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:29,147 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:29,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:49:29,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:49:29,348 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:29,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:29,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1889244600, now seen corresponding path program 1 times [2024-10-10 23:49:29,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:29,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949568849] [2024-10-10 23:49:29,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:29,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-10 23:49:29,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:29,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949568849] [2024-10-10 23:49:29,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949568849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:29,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:29,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:29,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681079408] [2024-10-10 23:49:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:29,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:29,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:29,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:29,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:29,699 INFO L87 Difference]: Start difference. First operand 27874 states and 31844 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:31,350 INFO L93 Difference]: Finished difference Result 64689 states and 73398 transitions. [2024-10-10 23:49:31,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:31,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 360 [2024-10-10 23:49:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:31,401 INFO L225 Difference]: With dead ends: 64689 [2024-10-10 23:49:31,401 INFO L226 Difference]: Without dead ends: 36816 [2024-10-10 23:49:31,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:31,431 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 484 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:31,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 280 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:49:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36816 states. [2024-10-10 23:49:31,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36816 to 36366. [2024-10-10 23:49:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36366 states, 36365 states have (on average 1.1224254090471608) internal successors, (40817), 36365 states have internal predecessors, (40817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36366 states to 36366 states and 40817 transitions. [2024-10-10 23:49:31,883 INFO L78 Accepts]: Start accepts. Automaton has 36366 states and 40817 transitions. Word has length 360 [2024-10-10 23:49:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:31,884 INFO L471 AbstractCegarLoop]: Abstraction has 36366 states and 40817 transitions. [2024-10-10 23:49:31,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36366 states and 40817 transitions. [2024-10-10 23:49:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-10-10 23:49:31,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:31,892 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:31,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:49:31,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:31,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1972559560, now seen corresponding path program 1 times [2024-10-10 23:49:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:31,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524760372] [2024-10-10 23:49:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-10 23:49:32,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:32,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524760372] [2024-10-10 23:49:32,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524760372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:32,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:32,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:32,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318475922] [2024-10-10 23:49:32,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:32,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:32,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:32,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:32,326 INFO L87 Difference]: Start difference. First operand 36366 states and 40817 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:33,716 INFO L93 Difference]: Finished difference Result 79525 states and 89551 transitions. [2024-10-10 23:49:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:33,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 381 [2024-10-10 23:49:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:33,766 INFO L225 Difference]: With dead ends: 79525 [2024-10-10 23:49:33,766 INFO L226 Difference]: Without dead ends: 43160 [2024-10-10 23:49:33,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:33,796 INFO L432 NwaCegarLoop]: 729 mSDtfsCounter, 272 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:33,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 790 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:49:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2024-10-10 23:49:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 43160. [2024-10-10 23:49:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43160 states, 43159 states have (on average 1.1083203966727682) internal successors, (47834), 43159 states have internal predecessors, (47834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43160 states to 43160 states and 47834 transitions. [2024-10-10 23:49:34,248 INFO L78 Accepts]: Start accepts. Automaton has 43160 states and 47834 transitions. Word has length 381 [2024-10-10 23:49:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:34,249 INFO L471 AbstractCegarLoop]: Abstraction has 43160 states and 47834 transitions. [2024-10-10 23:49:34,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 43160 states and 47834 transitions. [2024-10-10 23:49:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-10-10 23:49:34,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:34,260 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:34,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:49:34,260 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:34,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2053805907, now seen corresponding path program 1 times [2024-10-10 23:49:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391851037] [2024-10-10 23:49:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:49:34,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391851037] [2024-10-10 23:49:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391851037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:34,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:34,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:34,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936357421] [2024-10-10 23:49:34,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:34,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:34,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:34,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:34,686 INFO L87 Difference]: Start difference. First operand 43160 states and 47834 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:36,296 INFO L93 Difference]: Finished difference Result 98272 states and 108801 transitions. [2024-10-10 23:49:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:36,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 404 [2024-10-10 23:49:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:36,360 INFO L225 Difference]: With dead ends: 98272 [2024-10-10 23:49:36,360 INFO L226 Difference]: Without dead ends: 55113 [2024-10-10 23:49:36,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:36,391 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 336 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:36,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 633 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:49:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55113 states. [2024-10-10 23:49:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55113 to 52105. [2024-10-10 23:49:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52105 states, 52104 states have (on average 1.107707661599877) internal successors, (57716), 52104 states have internal predecessors, (57716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52105 states to 52105 states and 57716 transitions. [2024-10-10 23:49:37,075 INFO L78 Accepts]: Start accepts. Automaton has 52105 states and 57716 transitions. Word has length 404 [2024-10-10 23:49:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:37,076 INFO L471 AbstractCegarLoop]: Abstraction has 52105 states and 57716 transitions. [2024-10-10 23:49:37,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 52105 states and 57716 transitions. [2024-10-10 23:49:37,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-10-10 23:49:37,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:37,090 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, 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, 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] [2024-10-10 23:49:37,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:49:37,091 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:37,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash 202466359, now seen corresponding path program 1 times [2024-10-10 23:49:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:37,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462284282] [2024-10-10 23:49:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:49:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462284282] [2024-10-10 23:49:37,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462284282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:37,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:37,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:49:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828967562] [2024-10-10 23:49:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:37,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:37,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:37,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:37,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:37,970 INFO L87 Difference]: Start difference. First operand 52105 states and 57716 transitions. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:40,723 INFO L93 Difference]: Finished difference Result 130212 states and 143848 transitions. [2024-10-10 23:49:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 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 447 [2024-10-10 23:49:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:40,845 INFO L225 Difference]: With dead ends: 130212 [2024-10-10 23:49:40,845 INFO L226 Difference]: Without dead ends: 77683 [2024-10-10 23:49:40,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:40,893 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 779 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:40,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 158 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:49:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77683 states. [2024-10-10 23:49:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77683 to 69115. [2024-10-10 23:49:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69115 states, 69114 states have (on average 1.1005006221604885) internal successors, (76060), 69114 states have internal predecessors, (76060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69115 states to 69115 states and 76060 transitions. [2024-10-10 23:49:41,816 INFO L78 Accepts]: Start accepts. Automaton has 69115 states and 76060 transitions. Word has length 447 [2024-10-10 23:49:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:41,816 INFO L471 AbstractCegarLoop]: Abstraction has 69115 states and 76060 transitions. [2024-10-10 23:49:41,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 69115 states and 76060 transitions. [2024-10-10 23:49:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-10-10 23:49:41,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:41,830 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:41,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:49:41,830 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:41,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:41,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1406970959, now seen corresponding path program 1 times [2024-10-10 23:49:41,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:41,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122424368] [2024-10-10 23:49:41,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:41,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:49:42,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122424368] [2024-10-10 23:49:42,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122424368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:42,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:42,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189051908] [2024-10-10 23:49:42,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:42,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:42,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:42,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:42,729 INFO L87 Difference]: Start difference. First operand 69115 states and 76060 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:44,537 INFO L93 Difference]: Finished difference Result 153594 states and 169223 transitions. [2024-10-10 23:49:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:44,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 454 [2024-10-10 23:49:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:44,627 INFO L225 Difference]: With dead ends: 153594 [2024-10-10 23:49:44,627 INFO L226 Difference]: Without dead ends: 84055 [2024-10-10 23:49:44,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:44,667 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 446 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:44,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 698 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:49:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84055 states. [2024-10-10 23:49:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84055 to 82332. [2024-10-10 23:49:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82332 states, 82331 states have (on average 1.101116225965918) internal successors, (90656), 82331 states have internal predecessors, (90656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82332 states to 82332 states and 90656 transitions. [2024-10-10 23:49:45,863 INFO L78 Accepts]: Start accepts. Automaton has 82332 states and 90656 transitions. Word has length 454 [2024-10-10 23:49:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:45,864 INFO L471 AbstractCegarLoop]: Abstraction has 82332 states and 90656 transitions. [2024-10-10 23:49:45,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 82332 states and 90656 transitions. [2024-10-10 23:49:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-10-10 23:49:45,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:45,878 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:45,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:49:45,879 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:45,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1346558988, now seen corresponding path program 1 times [2024-10-10 23:49:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791490971] [2024-10-10 23:49:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-10 23:49:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:46,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791490971] [2024-10-10 23:49:46,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791490971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:46,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:49:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581573983] [2024-10-10 23:49:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:46,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:46,451 INFO L87 Difference]: Start difference. First operand 82332 states and 90656 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:47,542 INFO L93 Difference]: Finished difference Result 162523 states and 178774 transitions. [2024-10-10 23:49:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 468 [2024-10-10 23:49:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:47,627 INFO L225 Difference]: With dead ends: 162523 [2024-10-10 23:49:47,628 INFO L226 Difference]: Without dead ends: 80192 [2024-10-10 23:49:47,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:47,678 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 622 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:47,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 101 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:49:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80192 states. [2024-10-10 23:49:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80192 to 80177. [2024-10-10 23:49:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80177 states, 80176 states have (on average 1.0985581720215525) internal successors, (88078), 80176 states have internal predecessors, (88078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80177 states to 80177 states and 88078 transitions. [2024-10-10 23:49:48,796 INFO L78 Accepts]: Start accepts. Automaton has 80177 states and 88078 transitions. Word has length 468 [2024-10-10 23:49:48,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:48,797 INFO L471 AbstractCegarLoop]: Abstraction has 80177 states and 88078 transitions. [2024-10-10 23:49:48,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 80177 states and 88078 transitions. [2024-10-10 23:49:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-10-10 23:49:48,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:48,811 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:48,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:49:48,811 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:48,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 280560231, now seen corresponding path program 1 times [2024-10-10 23:49:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:48,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016066010] [2024-10-10 23:49:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:49:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016066010] [2024-10-10 23:49:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016066010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:49:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257113406] [2024-10-10 23:49:49,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:49,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:49,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:49,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:49,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:49,852 INFO L87 Difference]: Start difference. First operand 80177 states and 88078 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:52,459 INFO L93 Difference]: Finished difference Result 189349 states and 207624 transitions. [2024-10-10 23:49:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:49:52,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 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 486 [2024-10-10 23:49:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:52,572 INFO L225 Difference]: With dead ends: 189349 [2024-10-10 23:49:52,572 INFO L226 Difference]: Without dead ends: 104915 [2024-10-10 23:49:52,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:52,613 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 745 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:52,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 217 Invalid, 2853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:49:52,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104915 states. [2024-10-10 23:49:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104915 to 100610. [2024-10-10 23:49:54,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100610 states, 100609 states have (on average 1.0951207148465842) internal successors, (110179), 100609 states have internal predecessors, (110179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100610 states to 100610 states and 110179 transitions. [2024-10-10 23:49:54,346 INFO L78 Accepts]: Start accepts. Automaton has 100610 states and 110179 transitions. Word has length 486 [2024-10-10 23:49:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:54,347 INFO L471 AbstractCegarLoop]: Abstraction has 100610 states and 110179 transitions. [2024-10-10 23:49:54,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 100610 states and 110179 transitions. [2024-10-10 23:49:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-10-10 23:49:54,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:54,359 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:54,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:49:54,359 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:54,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:54,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1049462703, now seen corresponding path program 1 times [2024-10-10 23:49:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:54,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997604769] [2024-10-10 23:49:54,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:54,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-10 23:49:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:54,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997604769] [2024-10-10 23:49:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997604769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:54,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:49:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335498507] [2024-10-10 23:49:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:54,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:49:54,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:49:54,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:54,736 INFO L87 Difference]: Start difference. First operand 100610 states and 110179 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:49:56,644 INFO L93 Difference]: Finished difference Result 213970 states and 234378 transitions. [2024-10-10 23:49:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:49:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 491 [2024-10-10 23:49:56,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:49:56,790 INFO L225 Difference]: With dead ends: 213970 [2024-10-10 23:49:56,790 INFO L226 Difference]: Without dead ends: 113361 [2024-10-10 23:49:57,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:49:57,159 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 398 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:49:57,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 318 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-10 23:49:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113361 states. [2024-10-10 23:49:58,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113361 to 110799. [2024-10-10 23:49:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110799 states, 110798 states have (on average 1.0898572176393075) internal successors, (120754), 110798 states have internal predecessors, (120754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110799 states to 110799 states and 120754 transitions. [2024-10-10 23:49:58,495 INFO L78 Accepts]: Start accepts. Automaton has 110799 states and 120754 transitions. Word has length 491 [2024-10-10 23:49:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:49:58,496 INFO L471 AbstractCegarLoop]: Abstraction has 110799 states and 120754 transitions. [2024-10-10 23:49:58,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:49:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 110799 states and 120754 transitions. [2024-10-10 23:49:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-10-10 23:49:58,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:49:58,513 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:49:58,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:49:58,513 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:49:58,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:49:58,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1481142871, now seen corresponding path program 1 times [2024-10-10 23:49:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:49:58,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744208247] [2024-10-10 23:49:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:49:58,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:49:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:49:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-10 23:49:59,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:49:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744208247] [2024-10-10 23:49:59,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744208247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:49:59,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:49:59,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:49:59,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700860678] [2024-10-10 23:49:59,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:49:59,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:49:59,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:49:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:49:59,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:49:59,544 INFO L87 Difference]: Start difference. First operand 110799 states and 120754 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:50:02,302 INFO L93 Difference]: Finished difference Result 232232 states and 253624 transitions. [2024-10-10 23:50:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:50:02,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 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 502 [2024-10-10 23:50:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:50:02,442 INFO L225 Difference]: With dead ends: 232232 [2024-10-10 23:50:02,443 INFO L226 Difference]: Without dead ends: 121009 [2024-10-10 23:50:02,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:50:02,500 INFO L432 NwaCegarLoop]: 682 mSDtfsCounter, 807 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:50:02,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 786 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2744 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:50:02,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121009 states. [2024-10-10 23:50:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121009 to 106944. [2024-10-10 23:50:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106944 states, 106943 states have (on average 1.0883648298626372) internal successors, (116393), 106943 states have internal predecessors, (116393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106944 states to 106944 states and 116393 transitions. [2024-10-10 23:50:04,387 INFO L78 Accepts]: Start accepts. Automaton has 106944 states and 116393 transitions. Word has length 502 [2024-10-10 23:50:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:50:04,388 INFO L471 AbstractCegarLoop]: Abstraction has 106944 states and 116393 transitions. [2024-10-10 23:50:04,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:50:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 106944 states and 116393 transitions. [2024-10-10 23:50:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-10-10 23:50:04,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:50:04,414 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:50:04,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:50:04,414 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:50:04,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:50:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1343868679, now seen corresponding path program 1 times [2024-10-10 23:50:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:50:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449995694] [2024-10-10 23:50:04,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:50:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:05,658 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 427 proven. 41 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:50:05,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:50:05,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449995694] [2024-10-10 23:50:05,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449995694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:50:05,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695558190] [2024-10-10 23:50:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:50:05,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:50:05,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:50:05,662 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:50:05,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:50:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:50:05,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:50:05,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:50:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 455 proven. 82 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-10 23:50:06,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:50:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 455 proven. 82 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-10 23:50:07,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695558190] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:50:07,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:50:07,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-10-10 23:50:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982646419] [2024-10-10 23:50:07,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:50:07,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 23:50:07,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:50:07,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 23:50:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:50:07,265 INFO L87 Difference]: Start difference. First operand 106944 states and 116393 transitions. Second operand has 9 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)