./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/Problem15_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label11.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:19:38,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:19:38,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:19:38,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:19:38,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:19:38,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:19:38,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:19:38,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:19:38,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:19:38,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:19:38,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:19:38,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:19:38,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:19:38,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:19:38,584 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:19:38,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:19:38,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:19:38,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:19:38,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:19:38,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:19:38,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:19:38,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:19:38,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:19:38,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:19:38,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:19:38,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:19:38,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:19:38,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:19:38,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:19:38,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:19:38,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:19:38,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:19:38,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:19:38,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:19:38,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:19:38,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:19:38,595 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:19:38,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:19:38,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:19:38,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:19:38,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:19:38,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:19:38,597 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b [2024-10-23 21:19:38,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:19:38,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:19:38,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:19:38,878 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:19:38,878 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:19:38,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2024-10-23 21:19:40,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:19:40,604 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:19:40,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2024-10-23 21:19:40,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b1b06ea/dc87d1675a9b48ae84e9324accbefe92/FLAG9992a5386 [2024-10-23 21:19:40,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b1b06ea/dc87d1675a9b48ae84e9324accbefe92 [2024-10-23 21:19:40,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:19:40,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:19:40,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:19:40,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:19:40,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:19:40,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:19:40" (1/1) ... [2024-10-23 21:19:40,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43842149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:40, skipping insertion in model container [2024-10-23 21:19:40,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:19:40" (1/1) ... [2024-10-23 21:19:40,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:19:41,181 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/Problem15_label11.c[6732,6745] [2024-10-23 21:19:41,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:19:41,574 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:19:41,604 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/Problem15_label11.c[6732,6745] [2024-10-23 21:19:41,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:19:41,788 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:19:41,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41 WrapperNode [2024-10-23 21:19:41,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:19:41,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:19:41,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:19:41,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:19:41,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:41,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,099 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-23 21:19:42,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:19:42,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:19:42,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:19:42,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:19:42,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,323 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-23 21:19:42,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:19:42,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:19:42,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:19:42,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:19:42,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (1/1) ... [2024-10-23 21:19:42,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:19:42,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:19:42,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 21:19:42,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 21:19:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:19:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:19:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:19:42,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:19:42,630 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:19:42,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:19:44,932 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-23 21:19:44,933 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:19:44,993 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:19:44,997 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:19:44,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:19:44 BoogieIcfgContainer [2024-10-23 21:19:44,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:19:45,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:19:45,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:19:45,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:19:45,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:19:40" (1/3) ... [2024-10-23 21:19:45,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299c3bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:19:45, skipping insertion in model container [2024-10-23 21:19:45,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:19:41" (2/3) ... [2024-10-23 21:19:45,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299c3bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:19:45, skipping insertion in model container [2024-10-23 21:19:45,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:19:44" (3/3) ... [2024-10-23 21:19:45,008 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label11.c [2024-10-23 21:19:45,025 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:19:45,025 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:19:45,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:19:45,118 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;@453c4990, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:19:45,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:19:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-23 21:19:45,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:45,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:19:45,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:45,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:45,139 INFO L85 PathProgramCache]: Analyzing trace with hash 997447303, now seen corresponding path program 1 times [2024-10-23 21:19:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:45,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830495118] [2024-10-23 21:19:45,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:45,358 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-23 21:19:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830495118] [2024-10-23 21:19:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830495118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:45,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:19:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553141230] [2024-10-23 21:19:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:45,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:19:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:19:45,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:19:45,396 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:19:45,458 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-23 21:19:45,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:19:45,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-23 21:19:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:19:45,471 INFO L225 Difference]: With dead ends: 723 [2024-10-23 21:19:45,471 INFO L226 Difference]: Without dead ends: 360 [2024-10-23 21:19:45,475 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-23 21:19:45,477 INFO L432 NwaCegarLoop]: 623 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, 623 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-23 21:19:45,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:19:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-23 21:19:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-23 21:19:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-23 21:19:45,527 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 54 [2024-10-23 21:19:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:19:45,527 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-23 21:19:45,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-23 21:19:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-23 21:19:45,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:45,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:19:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:19:45,530 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash -837726197, now seen corresponding path program 1 times [2024-10-23 21:19:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541989535] [2024-10-23 21:19:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:45,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:45,730 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-23 21:19:45,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:45,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541989535] [2024-10-23 21:19:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541989535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:45,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:45,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:19:45,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718399311] [2024-10-23 21:19:45,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:45,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:19:45,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:45,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:19:45,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:19:45,736 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:19:47,431 INFO L93 Difference]: Finished difference Result 1052 states and 1830 transitions. [2024-10-23 21:19:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:19:47,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-23 21:19:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:19:47,435 INFO L225 Difference]: With dead ends: 1052 [2024-10-23 21:19:47,436 INFO L226 Difference]: Without dead ends: 693 [2024-10-23 21:19:47,437 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-23 21:19:47,438 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 315 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:19:47,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 91 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-23 21:19:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-23 21:19:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 683. [2024-10-23 21:19:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 1.719941348973607) internal successors, (1173), 682 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1173 transitions. [2024-10-23 21:19:47,479 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1173 transitions. Word has length 54 [2024-10-23 21:19:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:19:47,480 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1173 transitions. [2024-10-23 21:19:47,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1173 transitions. [2024-10-23 21:19:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-23 21:19:47,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:47,487 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, 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-23 21:19:47,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:19:47,487 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash 852881437, now seen corresponding path program 1 times [2024-10-23 21:19:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513764177] [2024-10-23 21:19:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:19:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513764177] [2024-10-23 21:19:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513764177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:47,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:19:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095046660] [2024-10-23 21:19:47,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:47,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:19:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:19:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:19:47,905 INFO L87 Difference]: Start difference. First operand 683 states and 1173 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:19:49,243 INFO L93 Difference]: Finished difference Result 1680 states and 2895 transitions. [2024-10-23 21:19:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:19:49,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-10-23 21:19:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:19:49,248 INFO L225 Difference]: With dead ends: 1680 [2024-10-23 21:19:49,249 INFO L226 Difference]: Without dead ends: 998 [2024-10-23 21:19:49,250 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-23 21:19:49,251 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:19:49,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 224 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:19:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-10-23 21:19:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 988. [2024-10-23 21:19:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 1.6200607902735562) internal successors, (1599), 987 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1599 transitions. [2024-10-23 21:19:49,291 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1599 transitions. Word has length 119 [2024-10-23 21:19:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:19:49,293 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1599 transitions. [2024-10-23 21:19:49,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1599 transitions. [2024-10-23 21:19:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-23 21:19:49,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:49,298 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, 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] [2024-10-23 21:19:49,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:19:49,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:49,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1581541642, now seen corresponding path program 1 times [2024-10-23 21:19:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:49,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938746962] [2024-10-23 21:19:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:49,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:49,479 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:19:49,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938746962] [2024-10-23 21:19:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938746962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:19:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886316856] [2024-10-23 21:19:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:49,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:19:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:49,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:19:49,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:19:49,484 INFO L87 Difference]: Start difference. First operand 988 states and 1599 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:19:50,921 INFO L93 Difference]: Finished difference Result 2574 states and 4254 transitions. [2024-10-23 21:19:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:19:50,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2024-10-23 21:19:50,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:19:50,928 INFO L225 Difference]: With dead ends: 2574 [2024-10-23 21:19:50,928 INFO L226 Difference]: Without dead ends: 1587 [2024-10-23 21:19:50,931 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-23 21:19:50,934 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:19:50,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 335 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:19:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2024-10-23 21:19:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1583. [2024-10-23 21:19:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1582 states have (on average 1.3988621997471555) internal successors, (2213), 1582 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2213 transitions. [2024-10-23 21:19:50,966 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2213 transitions. Word has length 120 [2024-10-23 21:19:50,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:19:50,968 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2213 transitions. [2024-10-23 21:19:50,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2213 transitions. [2024-10-23 21:19:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-23 21:19:50,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:50,973 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, 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-23 21:19:50,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:19:50,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:50,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -963920832, now seen corresponding path program 1 times [2024-10-23 21:19:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:50,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604054800] [2024-10-23 21:19:50,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:19:51,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604054800] [2024-10-23 21:19:51,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604054800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:51,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:51,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:19:51,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358495833] [2024-10-23 21:19:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:51,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:19:51,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:51,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:19:51,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:19:51,162 INFO L87 Difference]: Start difference. First operand 1583 states and 2213 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:19:52,595 INFO L93 Difference]: Finished difference Result 4067 states and 5865 transitions. [2024-10-23 21:19:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:19:52,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-23 21:19:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:19:52,606 INFO L225 Difference]: With dead ends: 4067 [2024-10-23 21:19:52,606 INFO L226 Difference]: Without dead ends: 2784 [2024-10-23 21:19:52,609 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-23 21:19:52,610 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 243 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:19:52,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 362 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:19:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-10-23 21:19:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2183. [2024-10-23 21:19:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 2182 states have (on average 1.3304307974335472) internal successors, (2903), 2182 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2903 transitions. [2024-10-23 21:19:52,648 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2903 transitions. Word has length 124 [2024-10-23 21:19:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:19:52,649 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 2903 transitions. [2024-10-23 21:19:52,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2903 transitions. [2024-10-23 21:19:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-23 21:19:52,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:52,654 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:19:52,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:19:52,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:52,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash 818100360, now seen corresponding path program 1 times [2024-10-23 21:19:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697341552] [2024-10-23 21:19:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-23 21:19:53,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:53,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697341552] [2024-10-23 21:19:53,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697341552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:53,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:53,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:19:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015399929] [2024-10-23 21:19:53,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:53,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:19:53,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:53,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:19:53,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:19:53,083 INFO L87 Difference]: Start difference. First operand 2183 states and 2903 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:19:54,287 INFO L93 Difference]: Finished difference Result 5867 states and 7889 transitions. [2024-10-23 21:19:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:19:54,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 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 324 [2024-10-23 21:19:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:19:54,300 INFO L225 Difference]: With dead ends: 5867 [2024-10-23 21:19:54,301 INFO L226 Difference]: Without dead ends: 3685 [2024-10-23 21:19:54,304 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-23 21:19:54,305 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:19:54,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-23 21:19:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2024-10-23 21:19:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3683. [2024-10-23 21:19:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3683 states, 3682 states have (on average 1.2582835415535036) internal successors, (4633), 3682 states have internal predecessors, (4633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4633 transitions. [2024-10-23 21:19:54,367 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4633 transitions. Word has length 324 [2024-10-23 21:19:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:19:54,368 INFO L471 AbstractCegarLoop]: Abstraction has 3683 states and 4633 transitions. [2024-10-23 21:19:54,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4633 transitions. [2024-10-23 21:19:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-10-23 21:19:54,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:54,375 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:19:54,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:19:54,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash -769856027, now seen corresponding path program 1 times [2024-10-23 21:19:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590736100] [2024-10-23 21:19:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-23 21:19:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:55,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590736100] [2024-10-23 21:19:55,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590736100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:55,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:19:55,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647136674] [2024-10-23 21:19:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:55,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:19:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:55,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:19:55,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:19:55,165 INFO L87 Difference]: Start difference. First operand 3683 states and 4633 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:19:56,712 INFO L93 Difference]: Finished difference Result 7664 states and 9576 transitions. [2024-10-23 21:19:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:19:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 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 372 [2024-10-23 21:19:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:19:56,725 INFO L225 Difference]: With dead ends: 7664 [2024-10-23 21:19:56,725 INFO L226 Difference]: Without dead ends: 3982 [2024-10-23 21:19:56,729 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-23 21:19:56,730 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:19:56,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-23 21:19:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2024-10-23 21:19:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3982. [2024-10-23 21:19:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3982 states, 3981 states have (on average 1.2403918613413716) internal successors, (4938), 3981 states have internal predecessors, (4938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 4938 transitions. [2024-10-23 21:19:56,788 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 4938 transitions. Word has length 372 [2024-10-23 21:19:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:19:56,788 INFO L471 AbstractCegarLoop]: Abstraction has 3982 states and 4938 transitions. [2024-10-23 21:19:56,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 2 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 4938 transitions. [2024-10-23 21:19:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2024-10-23 21:19:56,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:56,795 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:19:56,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:19:56,795 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:56,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash 655984297, now seen corresponding path program 1 times [2024-10-23 21:19:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:56,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245677887] [2024-10-23 21:19:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:56,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-23 21:19:57,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:57,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245677887] [2024-10-23 21:19:57,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245677887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:57,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:57,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:19:57,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674812423] [2024-10-23 21:19:57,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:57,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:19:57,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:19:57,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:19:57,089 INFO L87 Difference]: Start difference. First operand 3982 states and 4938 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:19:58,611 INFO L93 Difference]: Finished difference Result 8860 states and 11332 transitions. [2024-10-23 21:19:58,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:19:58,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 415 [2024-10-23 21:19:58,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:19:58,627 INFO L225 Difference]: With dead ends: 8860 [2024-10-23 21:19:58,627 INFO L226 Difference]: Without dead ends: 5178 [2024-10-23 21:19:58,631 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-23 21:19:58,633 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 258 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:19:58,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 320 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-23 21:19:58,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5178 states. [2024-10-23 21:19:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5178 to 3380. [2024-10-23 21:19:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3380 states, 3379 states have (on average 1.2630955904113643) internal successors, (4268), 3379 states have internal predecessors, (4268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 4268 transitions. [2024-10-23 21:19:58,693 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 4268 transitions. Word has length 415 [2024-10-23 21:19:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:19:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 3380 states and 4268 transitions. [2024-10-23 21:19:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:19:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 4268 transitions. [2024-10-23 21:19:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-10-23 21:19:58,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:19:58,701 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:19:58,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:19:58,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:19:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:19:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1252419392, now seen corresponding path program 1 times [2024-10-23 21:19:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:19:58,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022667084] [2024-10-23 21:19:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:19:58,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:19:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:19:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:19:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:19:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022667084] [2024-10-23 21:19:59,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022667084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:19:59,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:19:59,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 21:19:59,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134277948] [2024-10-23 21:19:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:19:59,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 21:19:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:19:59,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 21:19:59,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:19:59,355 INFO L87 Difference]: Start difference. First operand 3380 states and 4268 transitions. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:01,374 INFO L93 Difference]: Finished difference Result 8285 states and 10734 transitions. [2024-10-23 21:20:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:20:01,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 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 419 [2024-10-23 21:20:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:01,398 INFO L225 Difference]: With dead ends: 8285 [2024-10-23 21:20:01,398 INFO L226 Difference]: Without dead ends: 5205 [2024-10-23 21:20:01,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:20:01,404 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 348 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:01,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 718 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-23 21:20:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2024-10-23 21:20:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 4879. [2024-10-23 21:20:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4879 states, 4878 states have (on average 1.2060270602706027) internal successors, (5883), 4878 states have internal predecessors, (5883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 5883 transitions. [2024-10-23 21:20:01,503 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 5883 transitions. Word has length 419 [2024-10-23 21:20:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:01,504 INFO L471 AbstractCegarLoop]: Abstraction has 4879 states and 5883 transitions. [2024-10-23 21:20:01,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:01,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 5883 transitions. [2024-10-23 21:20:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-10-23 21:20:01,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:01,514 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:01,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 21:20:01,514 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:01,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 714655262, now seen corresponding path program 1 times [2024-10-23 21:20:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:01,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382038081] [2024-10-23 21:20:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:01,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-23 21:20:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382038081] [2024-10-23 21:20:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382038081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:01,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942184951] [2024-10-23 21:20:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:01,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:01,887 INFO L87 Difference]: Start difference. First operand 4879 states and 5883 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:03,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:03,040 INFO L93 Difference]: Finished difference Result 10955 states and 13580 transitions. [2024-10-23 21:20:03,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:03,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 431 [2024-10-23 21:20:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:03,057 INFO L225 Difference]: With dead ends: 10955 [2024-10-23 21:20:03,057 INFO L226 Difference]: Without dead ends: 6376 [2024-10-23 21:20:03,061 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-23 21:20:03,061 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 273 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:03,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 615 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-23 21:20:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6376 states. [2024-10-23 21:20:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6376 to 6373. [2024-10-23 21:20:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6373 states, 6372 states have (on average 1.1828311362209667) internal successors, (7537), 6372 states have internal predecessors, (7537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6373 states to 6373 states and 7537 transitions. [2024-10-23 21:20:03,147 INFO L78 Accepts]: Start accepts. Automaton has 6373 states and 7537 transitions. Word has length 431 [2024-10-23 21:20:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:03,148 INFO L471 AbstractCegarLoop]: Abstraction has 6373 states and 7537 transitions. [2024-10-23 21:20:03,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 6373 states and 7537 transitions. [2024-10-23 21:20:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-10-23 21:20:03,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:03,159 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:03,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:20:03,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:03,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1572596529, now seen corresponding path program 1 times [2024-10-23 21:20:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:03,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786508238] [2024-10-23 21:20:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-10-23 21:20:03,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:03,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786508238] [2024-10-23 21:20:03,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786508238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:03,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:03,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250042139] [2024-10-23 21:20:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:03,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:03,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:03,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:03,503 INFO L87 Difference]: Start difference. First operand 6373 states and 7537 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:04,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:04,979 INFO L93 Difference]: Finished difference Result 16632 states and 19880 transitions. [2024-10-23 21:20:04,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:04,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 528 [2024-10-23 21:20:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:05,005 INFO L225 Difference]: With dead ends: 16632 [2024-10-23 21:20:05,005 INFO L226 Difference]: Without dead ends: 10559 [2024-10-23 21:20:05,012 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-23 21:20:05,013 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 284 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:05,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 261 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:20:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2024-10-23 21:20:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 8466. [2024-10-23 21:20:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8466 states, 8465 states have (on average 1.1805079740106321) internal successors, (9993), 8465 states have internal predecessors, (9993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8466 states to 8466 states and 9993 transitions. [2024-10-23 21:20:05,115 INFO L78 Accepts]: Start accepts. Automaton has 8466 states and 9993 transitions. Word has length 528 [2024-10-23 21:20:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 8466 states and 9993 transitions. [2024-10-23 21:20:05,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 8466 states and 9993 transitions. [2024-10-23 21:20:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-10-23 21:20:05,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:05,128 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:05,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:20:05,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:05,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1383748738, now seen corresponding path program 1 times [2024-10-23 21:20:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874901025] [2024-10-23 21:20:05,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-23 21:20:05,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:05,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874901025] [2024-10-23 21:20:05,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874901025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:05,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:05,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064227916] [2024-10-23 21:20:05,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:05,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:05,648 INFO L87 Difference]: Start difference. First operand 8466 states and 9993 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:07,036 INFO L93 Difference]: Finished difference Result 19935 states and 23666 transitions. [2024-10-23 21:20:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:07,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 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 545 [2024-10-23 21:20:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:07,056 INFO L225 Difference]: With dead ends: 19935 [2024-10-23 21:20:07,057 INFO L226 Difference]: Without dead ends: 11769 [2024-10-23 21:20:07,066 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-23 21:20:07,066 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 243 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:07,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 616 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:20:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11769 states. [2024-10-23 21:20:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11769 to 11757. [2024-10-23 21:20:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 11756 states have (on average 1.1626403538618577) internal successors, (13668), 11756 states have internal predecessors, (13668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 13668 transitions. [2024-10-23 21:20:07,196 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 13668 transitions. Word has length 545 [2024-10-23 21:20:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:07,196 INFO L471 AbstractCegarLoop]: Abstraction has 11757 states and 13668 transitions. [2024-10-23 21:20:07,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 13668 transitions. [2024-10-23 21:20:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2024-10-23 21:20:07,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:07,206 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:07,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:20:07,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:07,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1907613301, now seen corresponding path program 1 times [2024-10-23 21:20:07,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:07,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198542736] [2024-10-23 21:20:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:07,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-23 21:20:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198542736] [2024-10-23 21:20:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198542736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:07,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:07,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358005516] [2024-10-23 21:20:07,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:07,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:07,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:07,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:07,663 INFO L87 Difference]: Start difference. First operand 11757 states and 13668 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:08,686 INFO L93 Difference]: Finished difference Result 23511 states and 27369 transitions. [2024-10-23 21:20:08,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 555 [2024-10-23 21:20:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:08,706 INFO L225 Difference]: With dead ends: 23511 [2024-10-23 21:20:08,707 INFO L226 Difference]: Without dead ends: 12054 [2024-10-23 21:20:08,718 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-23 21:20:08,719 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 463 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:08,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 68 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:20:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12054 states. [2024-10-23 21:20:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12054 to 11755. [2024-10-23 21:20:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11755 states, 11754 states have (on average 1.1624978730644886) internal successors, (13664), 11754 states have internal predecessors, (13664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11755 states to 11755 states and 13664 transitions. [2024-10-23 21:20:08,849 INFO L78 Accepts]: Start accepts. Automaton has 11755 states and 13664 transitions. Word has length 555 [2024-10-23 21:20:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:08,849 INFO L471 AbstractCegarLoop]: Abstraction has 11755 states and 13664 transitions. [2024-10-23 21:20:08,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 11755 states and 13664 transitions. [2024-10-23 21:20:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2024-10-23 21:20:08,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:08,860 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:08,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:20:08,861 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:08,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash 248367912, now seen corresponding path program 1 times [2024-10-23 21:20:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:08,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022476632] [2024-10-23 21:20:08,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:08,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-23 21:20:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022476632] [2024-10-23 21:20:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022476632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:09,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288547162] [2024-10-23 21:20:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:09,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:09,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:09,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:09,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:09,177 INFO L87 Difference]: Start difference. First operand 11755 states and 13664 transitions. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:10,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:10,149 INFO L93 Difference]: Finished difference Result 24705 states and 28703 transitions. [2024-10-23 21:20:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:10,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 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 575 [2024-10-23 21:20:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:10,165 INFO L225 Difference]: With dead ends: 24705 [2024-10-23 21:20:10,166 INFO L226 Difference]: Without dead ends: 13250 [2024-10-23 21:20:10,177 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-23 21:20:10,178 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:10,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 320 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:20:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13250 states. [2024-10-23 21:20:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13250 to 9958. [2024-10-23 21:20:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9958 states, 9957 states have (on average 1.177864818720498) internal successors, (11728), 9957 states have internal predecessors, (11728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:10,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9958 states to 9958 states and 11728 transitions. [2024-10-23 21:20:10,295 INFO L78 Accepts]: Start accepts. Automaton has 9958 states and 11728 transitions. Word has length 575 [2024-10-23 21:20:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:10,296 INFO L471 AbstractCegarLoop]: Abstraction has 9958 states and 11728 transitions. [2024-10-23 21:20:10,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9958 states and 11728 transitions. [2024-10-23 21:20:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2024-10-23 21:20:10,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:10,304 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:10,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:20:10,305 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:10,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:10,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1683270828, now seen corresponding path program 1 times [2024-10-23 21:20:10,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:10,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579201158] [2024-10-23 21:20:10,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-23 21:20:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579201158] [2024-10-23 21:20:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579201158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427250761] [2024-10-23 21:20:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:10,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:10,802 INFO L87 Difference]: Start difference. First operand 9958 states and 11728 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:12,022 INFO L93 Difference]: Finished difference Result 25895 states and 30601 transitions. [2024-10-23 21:20:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:12,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 581 [2024-10-23 21:20:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:12,045 INFO L225 Difference]: With dead ends: 25895 [2024-10-23 21:20:12,046 INFO L226 Difference]: Without dead ends: 16237 [2024-10-23 21:20:12,057 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-23 21:20:12,057 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 219 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:12,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 205 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-23 21:20:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16237 states. [2024-10-23 21:20:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16237 to 12051. [2024-10-23 21:20:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12051 states, 12050 states have (on average 1.199253112033195) internal successors, (14451), 12050 states have internal predecessors, (14451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12051 states to 12051 states and 14451 transitions. [2024-10-23 21:20:12,199 INFO L78 Accepts]: Start accepts. Automaton has 12051 states and 14451 transitions. Word has length 581 [2024-10-23 21:20:12,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:12,200 INFO L471 AbstractCegarLoop]: Abstraction has 12051 states and 14451 transitions. [2024-10-23 21:20:12,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 12051 states and 14451 transitions. [2024-10-23 21:20:12,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-10-23 21:20:12,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:12,210 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 21:20:12,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:20:12,210 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:12,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1003814397, now seen corresponding path program 1 times [2024-10-23 21:20:12,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:12,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652893646] [2024-10-23 21:20:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 599 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2024-10-23 21:20:12,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:12,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652893646] [2024-10-23 21:20:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652893646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:20:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019009401] [2024-10-23 21:20:12,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:20:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:20:12,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:20:12,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 21:20:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:13,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:20:13,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:20:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-23 21:20:13,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:20:13,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019009401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:13,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:20:13,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 21:20:13,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859167759] [2024-10-23 21:20:13,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:13,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:13,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:13,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:20:13,259 INFO L87 Difference]: Start difference. First operand 12051 states and 14451 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:14,514 INFO L93 Difference]: Finished difference Result 27092 states and 33238 transitions. [2024-10-23 21:20:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 618 [2024-10-23 21:20:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:14,537 INFO L225 Difference]: With dead ends: 27092 [2024-10-23 21:20:14,537 INFO L226 Difference]: Without dead ends: 15341 [2024-10-23 21:20:14,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:20:14,548 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 269 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:14,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 623 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-23 21:20:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15341 states. [2024-10-23 21:20:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15341 to 14444. [2024-10-23 21:20:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 14443 states have (on average 1.1806411410371807) internal successors, (17052), 14443 states have internal predecessors, (17052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 17052 transitions. [2024-10-23 21:20:14,699 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 17052 transitions. Word has length 618 [2024-10-23 21:20:14,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:14,700 INFO L471 AbstractCegarLoop]: Abstraction has 14444 states and 17052 transitions. [2024-10-23 21:20:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 17052 transitions. [2024-10-23 21:20:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2024-10-23 21:20:14,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:14,713 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:14,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 21:20:14,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-23 21:20:14,914 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:14,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2127985393, now seen corresponding path program 1 times [2024-10-23 21:20:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:14,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906684297] [2024-10-23 21:20:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-10-23 21:20:15,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:15,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906684297] [2024-10-23 21:20:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906684297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:20:15,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887843646] [2024-10-23 21:20:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:15,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:20:15,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:20:15,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:20:15,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 21:20:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:15,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 21:20:15,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:20:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 784 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-10-23 21:20:16,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:20:16,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887843646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:16,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:20:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 21:20:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274530182] [2024-10-23 21:20:16,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:16,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:20:16,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:20:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:20:16,604 INFO L87 Difference]: Start difference. First operand 14444 states and 17052 transitions. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:18,044 INFO L93 Difference]: Finished difference Result 29485 states and 34755 transitions. [2024-10-23 21:20:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:20:18,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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 675 [2024-10-23 21:20:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:18,058 INFO L225 Difference]: With dead ends: 29485 [2024-10-23 21:20:18,058 INFO L226 Difference]: Without dead ends: 15042 [2024-10-23 21:20:18,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:20:18,067 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 314 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:18,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 352 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:20:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15042 states. [2024-10-23 21:20:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15042 to 14743. [2024-10-23 21:20:18,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14743 states, 14742 states have (on average 1.174264007597341) internal successors, (17311), 14742 states have internal predecessors, (17311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14743 states to 14743 states and 17311 transitions. [2024-10-23 21:20:18,205 INFO L78 Accepts]: Start accepts. Automaton has 14743 states and 17311 transitions. Word has length 675 [2024-10-23 21:20:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:18,206 INFO L471 AbstractCegarLoop]: Abstraction has 14743 states and 17311 transitions. [2024-10-23 21:20:18,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 14743 states and 17311 transitions. [2024-10-23 21:20:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2024-10-23 21:20:18,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:18,218 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:20:18,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 21:20:18,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-23 21:20:18,419 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:18,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1160218717, now seen corresponding path program 1 times [2024-10-23 21:20:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:18,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968033898] [2024-10-23 21:20:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2024-10-23 21:20:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968033898] [2024-10-23 21:20:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968033898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695308695] [2024-10-23 21:20:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:18,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:18,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:18,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:18,840 INFO L87 Difference]: Start difference. First operand 14743 states and 17311 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:20,120 INFO L93 Difference]: Finished difference Result 35463 states and 41217 transitions. [2024-10-23 21:20:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 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 683 [2024-10-23 21:20:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:20,137 INFO L225 Difference]: With dead ends: 35463 [2024-10-23 21:20:20,137 INFO L226 Difference]: Without dead ends: 17731 [2024-10-23 21:20:20,149 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-23 21:20:20,150 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 243 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:20,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 592 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-23 21:20:20,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17731 states. [2024-10-23 21:20:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17731 to 17133. [2024-10-23 21:20:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17133 states, 17132 states have (on average 1.080259164137287) internal successors, (18507), 17132 states have internal predecessors, (18507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17133 states to 17133 states and 18507 transitions. [2024-10-23 21:20:20,318 INFO L78 Accepts]: Start accepts. Automaton has 17133 states and 18507 transitions. Word has length 683 [2024-10-23 21:20:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:20,318 INFO L471 AbstractCegarLoop]: Abstraction has 17133 states and 18507 transitions. [2024-10-23 21:20:20,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17133 states and 18507 transitions. [2024-10-23 21:20:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2024-10-23 21:20:20,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:20,332 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-23 21:20:20,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-23 21:20:20,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:20,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1586502011, now seen corresponding path program 1 times [2024-10-23 21:20:20,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:20,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727961836] [2024-10-23 21:20:20,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:21,086 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-23 21:20:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:21,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727961836] [2024-10-23 21:20:21,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727961836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:21,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:21,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:20:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568883720] [2024-10-23 21:20:21,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:21,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:20:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:21,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:20:21,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:20:21,089 INFO L87 Difference]: Start difference. First operand 17133 states and 18507 transitions. Second operand has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:22,721 INFO L93 Difference]: Finished difference Result 42663 states and 46015 transitions. [2024-10-23 21:20:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:20:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 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 731 [2024-10-23 21:20:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:22,749 INFO L225 Difference]: With dead ends: 42663 [2024-10-23 21:20:22,749 INFO L226 Difference]: Without dead ends: 22840 [2024-10-23 21:20:22,765 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-23 21:20:22,766 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 367 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:22,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 545 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-23 21:20:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22840 states. [2024-10-23 21:20:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22840 to 21040. [2024-10-23 21:20:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21040 states, 21039 states have (on average 1.0658301250059414) internal successors, (22424), 21039 states have internal predecessors, (22424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21040 states to 21040 states and 22424 transitions. [2024-10-23 21:20:23,071 INFO L78 Accepts]: Start accepts. Automaton has 21040 states and 22424 transitions. Word has length 731 [2024-10-23 21:20:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:23,072 INFO L471 AbstractCegarLoop]: Abstraction has 21040 states and 22424 transitions. [2024-10-23 21:20:23,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 21040 states and 22424 transitions. [2024-10-23 21:20:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2024-10-23 21:20:23,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:23,080 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:23,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-23 21:20:23,080 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1358443771, now seen corresponding path program 1 times [2024-10-23 21:20:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974080107] [2024-10-23 21:20:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 563 proven. 188 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-23 21:20:24,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974080107] [2024-10-23 21:20:24,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974080107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:20:24,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461464241] [2024-10-23 21:20:24,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:24,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:20:24,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:20:24,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:20:24,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 21:20:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:24,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:20:24,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:20:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-10-23 21:20:25,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:20:25,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461464241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:25,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:20:25,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 21:20:25,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066518931] [2024-10-23 21:20:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:25,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:25,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:25,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:25,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:20:25,967 INFO L87 Difference]: Start difference. First operand 21040 states and 22424 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:27,744 INFO L93 Difference]: Finished difference Result 46282 states and 49187 transitions. [2024-10-23 21:20:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 745 [2024-10-23 21:20:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:27,764 INFO L225 Difference]: With dead ends: 46282 [2024-10-23 21:20:27,765 INFO L226 Difference]: Without dead ends: 24944 [2024-10-23 21:20:27,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:20:27,777 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 307 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:27,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 95 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-23 21:20:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24944 states. [2024-10-23 21:20:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24944 to 20134. [2024-10-23 21:20:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20134 states, 20133 states have (on average 1.0620374509511747) internal successors, (21382), 20133 states have internal predecessors, (21382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20134 states to 20134 states and 21382 transitions. [2024-10-23 21:20:27,964 INFO L78 Accepts]: Start accepts. Automaton has 20134 states and 21382 transitions. Word has length 745 [2024-10-23 21:20:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:27,965 INFO L471 AbstractCegarLoop]: Abstraction has 20134 states and 21382 transitions. [2024-10-23 21:20:27,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20134 states and 21382 transitions. [2024-10-23 21:20:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2024-10-23 21:20:27,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:27,982 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:20:28,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-23 21:20:28,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:20:28,183 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:28,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:28,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1796526614, now seen corresponding path program 1 times [2024-10-23 21:20:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:28,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954413849] [2024-10-23 21:20:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-10-23 21:20:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:29,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954413849] [2024-10-23 21:20:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954413849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:29,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 21:20:29,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164290851] [2024-10-23 21:20:29,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:29,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:20:29,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:29,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:20:29,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:20:29,556 INFO L87 Difference]: Start difference. First operand 20134 states and 21382 transitions. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:30,634 INFO L93 Difference]: Finished difference Result 40867 states and 43381 transitions. [2024-10-23 21:20:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:20:30,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 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 864 [2024-10-23 21:20:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:30,650 INFO L225 Difference]: With dead ends: 40867 [2024-10-23 21:20:30,650 INFO L226 Difference]: Without dead ends: 20734 [2024-10-23 21:20:30,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:20:30,659 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 244 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:30,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 716 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-23 21:20:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20734 states. [2024-10-23 21:20:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20734 to 20734. [2024-10-23 21:20:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20734 states, 20733 states have (on average 1.0605315197993537) internal successors, (21988), 20733 states have internal predecessors, (21988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20734 states to 20734 states and 21988 transitions. [2024-10-23 21:20:30,808 INFO L78 Accepts]: Start accepts. Automaton has 20734 states and 21988 transitions. Word has length 864 [2024-10-23 21:20:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:30,808 INFO L471 AbstractCegarLoop]: Abstraction has 20734 states and 21988 transitions. [2024-10-23 21:20:30,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20734 states and 21988 transitions. [2024-10-23 21:20:30,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 895 [2024-10-23 21:20:30,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:30,820 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:30,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-23 21:20:30,821 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:30,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1183501571, now seen corresponding path program 1 times [2024-10-23 21:20:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653939581] [2024-10-23 21:20:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1068 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2024-10-23 21:20:31,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653939581] [2024-10-23 21:20:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653939581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:31,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:31,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:31,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265998134] [2024-10-23 21:20:31,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:31,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:31,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:31,434 INFO L87 Difference]: Start difference. First operand 20734 states and 21988 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:32,427 INFO L93 Difference]: Finished difference Result 42660 states and 45262 transitions. [2024-10-23 21:20:32,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:32,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 894 [2024-10-23 21:20:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:32,447 INFO L225 Difference]: With dead ends: 42660 [2024-10-23 21:20:32,447 INFO L226 Difference]: Without dead ends: 20731 [2024-10-23 21:20:32,455 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-23 21:20:32,455 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 251 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:32,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 469 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:20:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2024-10-23 21:20:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 19235. [2024-10-23 21:20:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19235 states, 19234 states have (on average 1.054278881147967) internal successors, (20278), 19234 states have internal predecessors, (20278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19235 states to 19235 states and 20278 transitions. [2024-10-23 21:20:32,615 INFO L78 Accepts]: Start accepts. Automaton has 19235 states and 20278 transitions. Word has length 894 [2024-10-23 21:20:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:32,616 INFO L471 AbstractCegarLoop]: Abstraction has 19235 states and 20278 transitions. [2024-10-23 21:20:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 19235 states and 20278 transitions. [2024-10-23 21:20:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 900 [2024-10-23 21:20:32,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:32,630 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:32,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-23 21:20:32,630 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:32,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 805331991, now seen corresponding path program 1 times [2024-10-23 21:20:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003585031] [2024-10-23 21:20:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 871 proven. 531 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-23 21:20:34,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:34,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003585031] [2024-10-23 21:20:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003585031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:20:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410531280] [2024-10-23 21:20:34,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:34,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:20:34,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:20:34,835 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:20:34,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 21:20:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:35,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:20:35,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:20:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-23 21:20:35,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:20:35,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410531280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:35,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:20:35,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-23 21:20:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951270535] [2024-10-23 21:20:35,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:35,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:35,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:35,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-23 21:20:35,436 INFO L87 Difference]: Start difference. First operand 19235 states and 20278 transitions. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:36,318 INFO L93 Difference]: Finished difference Result 38168 states and 40223 transitions. [2024-10-23 21:20:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:36,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 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 899 [2024-10-23 21:20:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:36,335 INFO L225 Difference]: With dead ends: 38168 [2024-10-23 21:20:36,335 INFO L226 Difference]: Without dead ends: 18934 [2024-10-23 21:20:36,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-23 21:20:36,347 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 227 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:36,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 477 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:20:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18934 states. [2024-10-23 21:20:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18934 to 18934. [2024-10-23 21:20:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18934 states, 18933 states have (on average 1.0419901758833783) internal successors, (19728), 18933 states have internal predecessors, (19728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18934 states to 18934 states and 19728 transitions. [2024-10-23 21:20:36,492 INFO L78 Accepts]: Start accepts. Automaton has 18934 states and 19728 transitions. Word has length 899 [2024-10-23 21:20:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:36,493 INFO L471 AbstractCegarLoop]: Abstraction has 18934 states and 19728 transitions. [2024-10-23 21:20:36,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 18934 states and 19728 transitions. [2024-10-23 21:20:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2024-10-23 21:20:36,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:36,503 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:36,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-23 21:20:36,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:20:36,704 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1115801997, now seen corresponding path program 1 times [2024-10-23 21:20:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718729987] [2024-10-23 21:20:36,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2024-10-23 21:20:38,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718729987] [2024-10-23 21:20:38,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718729987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:38,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 21:20:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191737977] [2024-10-23 21:20:38,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:38,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 21:20:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:38,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 21:20:38,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:20:38,193 INFO L87 Difference]: Start difference. First operand 18934 states and 19728 transitions. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:39,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:39,867 INFO L93 Difference]: Finished difference Result 39962 states and 41598 transitions. [2024-10-23 21:20:39,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 21:20:39,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 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 918 [2024-10-23 21:20:39,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:39,891 INFO L225 Difference]: With dead ends: 39962 [2024-10-23 21:20:39,891 INFO L226 Difference]: Without dead ends: 21029 [2024-10-23 21:20:39,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:20:39,903 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 561 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 2664 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:39,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 716 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2664 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-23 21:20:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21029 states. [2024-10-23 21:20:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21029 to 18635. [2024-10-23 21:20:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18635 states, 18634 states have (on average 1.042234624879253) internal successors, (19421), 18634 states have internal predecessors, (19421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18635 states to 18635 states and 19421 transitions. [2024-10-23 21:20:40,056 INFO L78 Accepts]: Start accepts. Automaton has 18635 states and 19421 transitions. Word has length 918 [2024-10-23 21:20:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:40,056 INFO L471 AbstractCegarLoop]: Abstraction has 18635 states and 19421 transitions. [2024-10-23 21:20:40,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18635 states and 19421 transitions. [2024-10-23 21:20:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2024-10-23 21:20:40,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:40,071 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:40,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-23 21:20:40,071 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1092301374, now seen corresponding path program 1 times [2024-10-23 21:20:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634289282] [2024-10-23 21:20:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:40,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1459 proven. 0 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2024-10-23 21:20:40,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:40,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634289282] [2024-10-23 21:20:40,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634289282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:40,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:40,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:40,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724537419] [2024-10-23 21:20:40,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:40,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:40,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:40,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:40,624 INFO L87 Difference]: Start difference. First operand 18635 states and 19421 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:41,422 INFO L93 Difference]: Finished difference Result 37269 states and 38841 transitions. [2024-10-23 21:20:41,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:41,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1011 [2024-10-23 21:20:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:41,439 INFO L225 Difference]: With dead ends: 37269 [2024-10-23 21:20:41,439 INFO L226 Difference]: Without dead ends: 18635 [2024-10-23 21:20:41,449 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-23 21:20:41,449 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 238 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:41,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 518 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:20:41,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18635 states. [2024-10-23 21:20:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18635 to 18037. [2024-10-23 21:20:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18037 states, 18036 states have (on average 1.0368707030383677) internal successors, (18701), 18036 states have internal predecessors, (18701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18037 states to 18037 states and 18701 transitions. [2024-10-23 21:20:41,587 INFO L78 Accepts]: Start accepts. Automaton has 18037 states and 18701 transitions. Word has length 1011 [2024-10-23 21:20:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:41,587 INFO L471 AbstractCegarLoop]: Abstraction has 18037 states and 18701 transitions. [2024-10-23 21:20:41,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 18037 states and 18701 transitions. [2024-10-23 21:20:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2024-10-23 21:20:41,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:41,603 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 21:20:41,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-23 21:20:41,603 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:41,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash 423018009, now seen corresponding path program 1 times [2024-10-23 21:20:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584774249] [2024-10-23 21:20:41,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:41,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 1295 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2024-10-23 21:20:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584774249] [2024-10-23 21:20:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584774249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:20:42,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:20:42,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:20:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745504199] [2024-10-23 21:20:42,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:20:42,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:20:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:20:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:20:42,313 INFO L87 Difference]: Start difference. First operand 18037 states and 18701 transitions. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:20:43,064 INFO L93 Difference]: Finished difference Result 33944 states and 34981 transitions. [2024-10-23 21:20:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:20:43,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 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 1012 [2024-10-23 21:20:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:20:43,078 INFO L225 Difference]: With dead ends: 33944 [2024-10-23 21:20:43,079 INFO L226 Difference]: Without dead ends: 15908 [2024-10-23 21:20:43,088 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-23 21:20:43,089 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 322 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:20:43,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 76 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:20:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15908 states. [2024-10-23 21:20:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15908 to 13805. [2024-10-23 21:20:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13805 states, 13804 states have (on average 1.0223848159953637) internal successors, (14113), 13804 states have internal predecessors, (14113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13805 states to 13805 states and 14113 transitions. [2024-10-23 21:20:43,202 INFO L78 Accepts]: Start accepts. Automaton has 13805 states and 14113 transitions. Word has length 1012 [2024-10-23 21:20:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:20:43,202 INFO L471 AbstractCegarLoop]: Abstraction has 13805 states and 14113 transitions. [2024-10-23 21:20:43,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:20:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 13805 states and 14113 transitions. [2024-10-23 21:20:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1166 [2024-10-23 21:20:43,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:20:43,216 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:20:43,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-23 21:20:43,216 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:20:43,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:20:43,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1136324157, now seen corresponding path program 1 times [2024-10-23 21:20:43,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:20:43,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087232726] [2024-10-23 21:20:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:20:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 1634 proven. 41 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-10-23 21:20:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:20:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087232726] [2024-10-23 21:20:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087232726] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:20:44,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310057199] [2024-10-23 21:20:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:20:44,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:20:44,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:20:44,973 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:20:44,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-23 21:20:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:20:45,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 21:20:45,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:20:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2024-10-23 21:20:45,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 21:20:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2024-10-23 21:20:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310057199] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 21:20:45,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 21:20:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2024-10-23 21:20:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761198468] [2024-10-23 21:20:45,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 21:20:45,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-23 21:20:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:20:45,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-23 21:20:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-23 21:20:45,903 INFO L87 Difference]: Start difference. First operand 13805 states and 14113 transitions. Second operand has 10 states, 10 states have (on average 133.2) internal successors, (1332), 10 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)