./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_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label19.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 2d6129311caad436efd8aeb5ae8e8416588f34a9e58c3ca845c70b3697b0a672 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:45:55,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:45:55,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:45:55,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:45:55,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:45:55,248 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:45:55,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:45:55,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:45:55,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:45:55,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:45:55,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:45:55,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:45:55,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:45:55,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:45:55,255 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:45:55,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:45:55,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:45:55,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:45:55,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:45:55,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:45:55,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:45:55,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:45:55,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:45:55,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:45:55,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:45:55,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:45:55,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:45:55,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:45:55,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:45:55,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:45:55,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:45:55,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:45:55,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:45:55,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:45:55,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:45:55,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:45:55,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:45:55,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:45:55,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:45:55,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:45:55,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:45:55,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:45:55,265 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 -> 2d6129311caad436efd8aeb5ae8e8416588f34a9e58c3ca845c70b3697b0a672 [2024-10-13 23:45:55,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:45:55,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:45:55,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:45:55,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:45:55,562 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:45:55,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label19.c [2024-10-13 23:45:56,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:45:57,305 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:45:57,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label19.c [2024-10-13 23:45:57,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4efc77683/b9a0458ba03d43ad937cdcfd1564fc47/FLAG1a222701b [2024-10-13 23:45:57,542 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4efc77683/b9a0458ba03d43ad937cdcfd1564fc47 [2024-10-13 23:45:57,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:45:57,545 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:45:57,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:45:57,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:45:57,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:45:57,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:45:57" (1/1) ... [2024-10-13 23:45:57,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c788fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:57, skipping insertion in model container [2024-10-13 23:45:57,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:45:57" (1/1) ... [2024-10-13 23:45:57,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:45:57,842 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_label19.c[5585,5598] [2024-10-13 23:45:58,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:45:58,203 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:45:58,230 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_label19.c[5585,5598] [2024-10-13 23:45:58,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:45:58,517 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:45:58,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58 WrapperNode [2024-10-13 23:45:58,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:45:58,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:45:58,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:45:58,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:45:58,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:58,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:58,709 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-13 23:45:58,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:45:58,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:45:58,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:45:58,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:45:58,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:58,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:58,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:58,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:45:58,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:58,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:58,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:58,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:59,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:59,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:59,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:45:59,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:45:59,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:45:59,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:45:59,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (1/1) ... [2024-10-13 23:45:59,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:45:59,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:45:59,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:45:59,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:45:59,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:45:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:45:59,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:45:59,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:45:59,222 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:45:59,223 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:46:01,655 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-13 23:46:01,655 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:46:01,732 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:46:01,732 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:46:01,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:46:01 BoogieIcfgContainer [2024-10-13 23:46:01,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:46:01,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:46:01,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:46:01,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:46:01,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:45:57" (1/3) ... [2024-10-13 23:46:01,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710982b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:46:01, skipping insertion in model container [2024-10-13 23:46:01,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:58" (2/3) ... [2024-10-13 23:46:01,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710982b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:46:01, skipping insertion in model container [2024-10-13 23:46:01,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:46:01" (3/3) ... [2024-10-13 23:46:01,744 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label19.c [2024-10-13 23:46:01,763 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:46:01,764 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:46:01,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:46:01,861 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;@23dea41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:46:01,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:46:01,869 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-13 23:46:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 23:46:01,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:01,878 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] [2024-10-13 23:46:01,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:01,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:01,886 INFO L85 PathProgramCache]: Analyzing trace with hash -748454700, now seen corresponding path program 1 times [2024-10-13 23:46:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:01,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420008833] [2024-10-13 23:46:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:01,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:02,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:02,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420008833] [2024-10-13 23:46:02,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420008833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:02,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:02,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:46:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082373316] [2024-10-13 23:46:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:02,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:46:02,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:46:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:46:02,157 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:02,223 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-13 23:46:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:46:02,226 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-13 23:46:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:02,240 INFO L225 Difference]: With dead ends: 723 [2024-10-13 23:46:02,240 INFO L226 Difference]: Without dead ends: 360 [2024-10-13 23:46:02,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:46:02,250 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-13 23:46:02,251 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-13 23:46:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-13 23:46:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-13 23:46:02,310 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-13 23:46:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-13 23:46:02,318 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 44 [2024-10-13 23:46:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:02,319 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-13 23:46:02,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-13 23:46:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 23:46:02,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:02,321 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] [2024-10-13 23:46:02,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:46:02,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:02,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:02,322 INFO L85 PathProgramCache]: Analyzing trace with hash 214297539, now seen corresponding path program 1 times [2024-10-13 23:46:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:02,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115641571] [2024-10-13 23:46:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115641571] [2024-10-13 23:46:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115641571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:02,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:46:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285370062] [2024-10-13 23:46:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:02,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:02,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:02,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:02,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:02,557 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:04,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:04,167 INFO L93 Difference]: Finished difference Result 1023 states and 1787 transitions. [2024-10-13 23:46:04,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:04,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-13 23:46:04,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:04,171 INFO L225 Difference]: With dead ends: 1023 [2024-10-13 23:46:04,171 INFO L226 Difference]: Without dead ends: 664 [2024-10-13 23:46:04,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:04,174 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 272 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 316 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.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:04,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:46:04,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-13 23:46:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 662. [2024-10-13 23:46:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.4826021180030258) internal successors, (980), 661 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 980 transitions. [2024-10-13 23:46:04,206 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 980 transitions. Word has length 44 [2024-10-13 23:46:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:04,207 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 980 transitions. [2024-10-13 23:46:04,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 980 transitions. [2024-10-13 23:46:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-13 23:46:04,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:04,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:04,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:46:04,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:04,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1291443637, now seen corresponding path program 1 times [2024-10-13 23:46:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:04,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283788190] [2024-10-13 23:46:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:04,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:04,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:04,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283788190] [2024-10-13 23:46:04,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283788190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:04,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:04,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:46:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767595778] [2024-10-13 23:46:04,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:04,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:04,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:04,587 INFO L87 Difference]: Start difference. First operand 662 states and 980 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:05,886 INFO L93 Difference]: Finished difference Result 1623 states and 2314 transitions. [2024-10-13 23:46:05,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:05,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-10-13 23:46:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:05,890 INFO L225 Difference]: With dead ends: 1623 [2024-10-13 23:46:05,890 INFO L226 Difference]: Without dead ends: 962 [2024-10-13 23:46:05,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:05,892 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:05,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 335 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:46:05,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-13 23:46:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-10-13 23:46:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.3631633714880333) internal successors, (1310), 961 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1310 transitions. [2024-10-13 23:46:05,917 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1310 transitions. Word has length 109 [2024-10-13 23:46:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:05,919 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1310 transitions. [2024-10-13 23:46:05,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1310 transitions. [2024-10-13 23:46:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 23:46:05,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:05,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:05,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:46:05,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:05,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:05,927 INFO L85 PathProgramCache]: Analyzing trace with hash 942833368, now seen corresponding path program 1 times [2024-10-13 23:46:05,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:05,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661798344] [2024-10-13 23:46:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:06,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661798344] [2024-10-13 23:46:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661798344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:06,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:46:06,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557908306] [2024-10-13 23:46:06,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:06,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:06,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:06,094 INFO L87 Difference]: Start difference. First operand 962 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:07,693 INFO L93 Difference]: Finished difference Result 2228 states and 3185 transitions. [2024-10-13 23:46:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-10-13 23:46:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:07,700 INFO L225 Difference]: With dead ends: 2228 [2024-10-13 23:46:07,700 INFO L226 Difference]: Without dead ends: 1566 [2024-10-13 23:46:07,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:07,703 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:07,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 314 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:46:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-10-13 23:46:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1265. [2024-10-13 23:46:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1265 states, 1264 states have (on average 1.3053797468354431) internal successors, (1650), 1264 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1650 transitions. [2024-10-13 23:46:07,733 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1650 transitions. Word has length 114 [2024-10-13 23:46:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:07,735 INFO L471 AbstractCegarLoop]: Abstraction has 1265 states and 1650 transitions. [2024-10-13 23:46:07,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1650 transitions. [2024-10-13 23:46:07,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 23:46:07,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:07,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:07,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:46:07,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:07,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -453003196, now seen corresponding path program 1 times [2024-10-13 23:46:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672534167] [2024-10-13 23:46:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:07,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:07,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672534167] [2024-10-13 23:46:07,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672534167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:07,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:07,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:07,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474312688] [2024-10-13 23:46:07,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:07,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:07,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:07,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:07,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:07,923 INFO L87 Difference]: Start difference. First operand 1265 states and 1650 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:09,635 INFO L93 Difference]: Finished difference Result 3132 states and 4192 transitions. [2024-10-13 23:46:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:09,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2024-10-13 23:46:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:09,641 INFO L225 Difference]: With dead ends: 3132 [2024-10-13 23:46:09,642 INFO L226 Difference]: Without dead ends: 1868 [2024-10-13 23:46:09,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:09,644 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 299 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:09,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 611 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 23:46:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2024-10-13 23:46:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1868. [2024-10-13 23:46:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1867 states have (on average 1.244242099625067) internal successors, (2323), 1867 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2323 transitions. [2024-10-13 23:46:09,675 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2323 transitions. Word has length 135 [2024-10-13 23:46:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:09,676 INFO L471 AbstractCegarLoop]: Abstraction has 1868 states and 2323 transitions. [2024-10-13 23:46:09,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2323 transitions. [2024-10-13 23:46:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-13 23:46:09,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:09,679 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, 2, 2, 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] [2024-10-13 23:46:09,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:46:09,680 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:09,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:09,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1277204468, now seen corresponding path program 1 times [2024-10-13 23:46:09,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:09,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255353753] [2024-10-13 23:46:09,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:09,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 23:46:09,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255353753] [2024-10-13 23:46:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255353753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:09,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:09,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:46:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337001460] [2024-10-13 23:46:09,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:09,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:09,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:09,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:09,928 INFO L87 Difference]: Start difference. First operand 1868 states and 2323 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:11,061 INFO L93 Difference]: Finished difference Result 5239 states and 6568 transitions. [2024-10-13 23:46:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 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 203 [2024-10-13 23:46:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:11,070 INFO L225 Difference]: With dead ends: 5239 [2024-10-13 23:46:11,070 INFO L226 Difference]: Without dead ends: 2774 [2024-10-13 23:46:11,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:11,073 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 257 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 331 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:11,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 331 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:11,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2024-10-13 23:46:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2770. [2024-10-13 23:46:11,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2769 states have (on average 1.1520404478150956) internal successors, (3190), 2769 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3190 transitions. [2024-10-13 23:46:11,116 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3190 transitions. Word has length 203 [2024-10-13 23:46:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:11,117 INFO L471 AbstractCegarLoop]: Abstraction has 2770 states and 3190 transitions. [2024-10-13 23:46:11,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3190 transitions. [2024-10-13 23:46:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-13 23:46:11,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:11,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:11,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:46:11,122 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:11,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:11,123 INFO L85 PathProgramCache]: Analyzing trace with hash 982052824, now seen corresponding path program 1 times [2024-10-13 23:46:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:11,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572811050] [2024-10-13 23:46:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572811050] [2024-10-13 23:46:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572811050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:11,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:11,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15743620] [2024-10-13 23:46:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:11,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:11,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:11,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:11,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:11,534 INFO L87 Difference]: Start difference. First operand 2770 states and 3190 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:13,594 INFO L93 Difference]: Finished difference Result 8251 states and 9470 transitions. [2024-10-13 23:46:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:13,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2024-10-13 23:46:13,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:13,608 INFO L225 Difference]: With dead ends: 8251 [2024-10-13 23:46:13,609 INFO L226 Difference]: Without dead ends: 5183 [2024-10-13 23:46:13,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:13,615 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 464 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1717 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:13,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 120 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1717 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 23:46:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2024-10-13 23:46:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 4573. [2024-10-13 23:46:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4572 states have (on average 1.155074365704287) internal successors, (5281), 4572 states have internal predecessors, (5281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5281 transitions. [2024-10-13 23:46:13,688 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5281 transitions. Word has length 277 [2024-10-13 23:46:13,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:13,688 INFO L471 AbstractCegarLoop]: Abstraction has 4573 states and 5281 transitions. [2024-10-13 23:46:13,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5281 transitions. [2024-10-13 23:46:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-10-13 23:46:13,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:13,693 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:46:13,693 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 330621781, now seen corresponding path program 1 times [2024-10-13 23:46:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839747879] [2024-10-13 23:46:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-10-13 23:46:14,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839747879] [2024-10-13 23:46:14,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839747879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:14,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:14,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:46:14,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267020917] [2024-10-13 23:46:14,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:14,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:14,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:14,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:14,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:14,394 INFO L87 Difference]: Start difference. First operand 4573 states and 5281 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:15,768 INFO L93 Difference]: Finished difference Result 8846 states and 10258 transitions. [2024-10-13 23:46:15,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:15,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 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 321 [2024-10-13 23:46:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:15,782 INFO L225 Difference]: With dead ends: 8846 [2024-10-13 23:46:15,782 INFO L226 Difference]: Without dead ends: 4573 [2024-10-13 23:46:15,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:15,787 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:15,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 303 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:46:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2024-10-13 23:46:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4573. [2024-10-13 23:46:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4572 states have (on average 1.1546369203849518) internal successors, (5279), 4572 states have internal predecessors, (5279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 5279 transitions. [2024-10-13 23:46:15,904 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 5279 transitions. Word has length 321 [2024-10-13 23:46:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:15,904 INFO L471 AbstractCegarLoop]: Abstraction has 4573 states and 5279 transitions. [2024-10-13 23:46:15,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 5279 transitions. [2024-10-13 23:46:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-10-13 23:46:15,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:15,911 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:15,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:46:15,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:15,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash 409335655, now seen corresponding path program 1 times [2024-10-13 23:46:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:15,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045880292] [2024-10-13 23:46:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 85 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:16,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:16,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045880292] [2024-10-13 23:46:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045880292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:16,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120858704] [2024-10-13 23:46:16,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:16,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:16,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:16,869 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-13 23:46:16,871 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-13 23:46:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:17,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:46:17,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 23:46:17,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:17,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120858704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:17,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:17,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:46:17,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175669680] [2024-10-13 23:46:17,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:17,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:17,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:17,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:17,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:17,236 INFO L87 Difference]: Start difference. First operand 4573 states and 5279 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:18,233 INFO L93 Difference]: Finished difference Result 8847 states and 10259 transitions. [2024-10-13 23:46:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 395 [2024-10-13 23:46:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:18,248 INFO L225 Difference]: With dead ends: 8847 [2024-10-13 23:46:18,249 INFO L226 Difference]: Without dead ends: 4574 [2024-10-13 23:46:18,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:18,256 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 340 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:18,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 412 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2024-10-13 23:46:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 3970. [2024-10-13 23:46:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3970 states, 3969 states have (on average 1.1428571428571428) internal successors, (4536), 3969 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 4536 transitions. [2024-10-13 23:46:18,318 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 4536 transitions. Word has length 395 [2024-10-13 23:46:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:18,319 INFO L471 AbstractCegarLoop]: Abstraction has 3970 states and 4536 transitions. [2024-10-13 23:46:18,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 4536 transitions. [2024-10-13 23:46:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-10-13 23:46:18,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:18,325 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:18,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 23:46:18,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:18,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1775065923, now seen corresponding path program 1 times [2024-10-13 23:46:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:18,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111875405] [2024-10-13 23:46:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:18,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:18,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111875405] [2024-10-13 23:46:18,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111875405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:18,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:18,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:18,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63930660] [2024-10-13 23:46:18,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:18,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:18,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:18,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:18,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:18,947 INFO L87 Difference]: Start difference. First operand 3970 states and 4536 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:20,411 INFO L93 Difference]: Finished difference Result 9445 states and 11015 transitions. [2024-10-13 23:46:20,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:20,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 401 [2024-10-13 23:46:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:20,425 INFO L225 Difference]: With dead ends: 9445 [2024-10-13 23:46:20,426 INFO L226 Difference]: Without dead ends: 5775 [2024-10-13 23:46:20,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:20,430 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 230 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:20,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 597 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:46:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2024-10-13 23:46:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5767. [2024-10-13 23:46:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5767 states, 5766 states have (on average 1.1189732917100244) internal successors, (6452), 5766 states have internal predecessors, (6452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 6452 transitions. [2024-10-13 23:46:20,527 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 6452 transitions. Word has length 401 [2024-10-13 23:46:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:20,529 INFO L471 AbstractCegarLoop]: Abstraction has 5767 states and 6452 transitions. [2024-10-13 23:46:20,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 6452 transitions. [2024-10-13 23:46:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2024-10-13 23:46:20,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:20,537 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:20,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:46:20,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:20,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1097483394, now seen corresponding path program 1 times [2024-10-13 23:46:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:20,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922016698] [2024-10-13 23:46:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:20,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-10-13 23:46:21,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:21,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922016698] [2024-10-13 23:46:21,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922016698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:21,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:21,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017298447] [2024-10-13 23:46:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:21,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:21,217 INFO L87 Difference]: Start difference. First operand 5767 states and 6452 transitions. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:23,089 INFO L93 Difference]: Finished difference Result 13344 states and 15005 transitions. [2024-10-13 23:46:23,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 457 [2024-10-13 23:46:23,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:23,106 INFO L225 Difference]: With dead ends: 13344 [2024-10-13 23:46:23,106 INFO L226 Difference]: Without dead ends: 7578 [2024-10-13 23:46:23,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:23,113 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 431 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:23,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 121 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 23:46:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7578 states. [2024-10-13 23:46:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7578 to 5770. [2024-10-13 23:46:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 5769 states have (on average 1.1176980412549835) internal successors, (6448), 5769 states have internal predecessors, (6448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 6448 transitions. [2024-10-13 23:46:23,191 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 6448 transitions. Word has length 457 [2024-10-13 23:46:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:23,192 INFO L471 AbstractCegarLoop]: Abstraction has 5770 states and 6448 transitions. [2024-10-13 23:46:23,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 6448 transitions. [2024-10-13 23:46:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2024-10-13 23:46:23,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:23,197 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:23,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:46:23,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:23,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1993927307, now seen corresponding path program 1 times [2024-10-13 23:46:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:23,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082907987] [2024-10-13 23:46:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:23,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 23:46:23,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:23,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082907987] [2024-10-13 23:46:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082907987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:23,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412631516] [2024-10-13 23:46:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:23,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:23,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:23,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:23,623 INFO L87 Difference]: Start difference. First operand 5770 states and 6448 transitions. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:24,537 INFO L93 Difference]: Finished difference Result 13040 states and 14826 transitions. [2024-10-13 23:46:24,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 495 [2024-10-13 23:46:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:24,549 INFO L225 Difference]: With dead ends: 13040 [2024-10-13 23:46:24,549 INFO L226 Difference]: Without dead ends: 7570 [2024-10-13 23:46:24,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:24,555 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 249 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:24,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 563 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:46:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2024-10-13 23:46:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 7564. [2024-10-13 23:46:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7564 states, 7563 states have (on average 1.1067036890122968) internal successors, (8370), 7563 states have internal predecessors, (8370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 8370 transitions. [2024-10-13 23:46:24,647 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 8370 transitions. Word has length 495 [2024-10-13 23:46:24,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:24,648 INFO L471 AbstractCegarLoop]: Abstraction has 7564 states and 8370 transitions. [2024-10-13 23:46:24,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 8370 transitions. [2024-10-13 23:46:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2024-10-13 23:46:24,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:24,653 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:46:24,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:46:24,653 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:24,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash 398202930, now seen corresponding path program 1 times [2024-10-13 23:46:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278092726] [2024-10-13 23:46:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-13 23:46:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278092726] [2024-10-13 23:46:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278092726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:25,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:25,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:25,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916879775] [2024-10-13 23:46:25,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:25,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:25,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:25,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:25,036 INFO L87 Difference]: Start difference. First operand 7564 states and 8370 transitions. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:26,065 INFO L93 Difference]: Finished difference Result 17818 states and 19982 transitions. [2024-10-13 23:46:26,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:26,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 554 [2024-10-13 23:46:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:26,082 INFO L225 Difference]: With dead ends: 17818 [2024-10-13 23:46:26,082 INFO L226 Difference]: Without dead ends: 9956 [2024-10-13 23:46:26,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:26,091 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 248 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:26,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 300 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2024-10-13 23:46:26,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 6362. [2024-10-13 23:46:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6362 states, 6361 states have (on average 1.09353875176859) internal successors, (6956), 6361 states have internal predecessors, (6956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 6956 transitions. [2024-10-13 23:46:26,178 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 6956 transitions. Word has length 554 [2024-10-13 23:46:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:26,179 INFO L471 AbstractCegarLoop]: Abstraction has 6362 states and 6956 transitions. [2024-10-13 23:46:26,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 6956 transitions. [2024-10-13 23:46:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2024-10-13 23:46:26,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:26,186 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, 4, 4, 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, 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] [2024-10-13 23:46:26,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:46:26,186 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:26,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:26,187 INFO L85 PathProgramCache]: Analyzing trace with hash -658911057, now seen corresponding path program 1 times [2024-10-13 23:46:26,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:26,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606880524] [2024-10-13 23:46:26,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:26,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-10-13 23:46:26,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606880524] [2024-10-13 23:46:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606880524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:26,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772893435] [2024-10-13 23:46:26,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:26,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:26,698 INFO L87 Difference]: Start difference. First operand 6362 states and 6956 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:27,790 INFO L93 Difference]: Finished difference Result 16921 states and 18577 transitions. [2024-10-13 23:46:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:27,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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 611 [2024-10-13 23:46:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:27,806 INFO L225 Difference]: With dead ends: 16921 [2024-10-13 23:46:27,806 INFO L226 Difference]: Without dead ends: 10859 [2024-10-13 23:46:27,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:27,814 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 253 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:27,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 567 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10859 states. [2024-10-13 23:46:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10859 to 10850. [2024-10-13 23:46:27,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10850 states, 10849 states have (on average 1.0813899898608166) internal successors, (11732), 10849 states have internal predecessors, (11732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10850 states to 10850 states and 11732 transitions. [2024-10-13 23:46:27,985 INFO L78 Accepts]: Start accepts. Automaton has 10850 states and 11732 transitions. Word has length 611 [2024-10-13 23:46:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:27,986 INFO L471 AbstractCegarLoop]: Abstraction has 10850 states and 11732 transitions. [2024-10-13 23:46:27,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10850 states and 11732 transitions. [2024-10-13 23:46:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-10-13 23:46:27,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:27,993 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:27,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:46:27,994 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:27,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:27,995 INFO L85 PathProgramCache]: Analyzing trace with hash -492846785, now seen corresponding path program 1 times [2024-10-13 23:46:27,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:27,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300079807] [2024-10-13 23:46:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-10-13 23:46:28,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:28,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300079807] [2024-10-13 23:46:28,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300079807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:28,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:28,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178617752] [2024-10-13 23:46:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:28,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:28,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:28,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:28,276 INFO L87 Difference]: Start difference. First operand 10850 states and 11732 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:29,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:29,409 INFO L93 Difference]: Finished difference Result 23791 states and 25815 transitions. [2024-10-13 23:46:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:29,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 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-13 23:46:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:29,428 INFO L225 Difference]: With dead ends: 23791 [2024-10-13 23:46:29,429 INFO L226 Difference]: Without dead ends: 13241 [2024-10-13 23:46:29,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:29,441 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 299 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:29,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 416 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13241 states. [2024-10-13 23:46:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13241 to 11148. [2024-10-13 23:46:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11148 states, 11147 states have (on average 1.0840584910738316) internal successors, (12084), 11147 states have internal predecessors, (12084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11148 states to 11148 states and 12084 transitions. [2024-10-13 23:46:29,620 INFO L78 Accepts]: Start accepts. Automaton has 11148 states and 12084 transitions. Word has length 618 [2024-10-13 23:46:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:29,621 INFO L471 AbstractCegarLoop]: Abstraction has 11148 states and 12084 transitions. [2024-10-13 23:46:29,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11148 states and 12084 transitions. [2024-10-13 23:46:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2024-10-13 23:46:29,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:29,629 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-13 23:46:29,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:46:29,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:29,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:29,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1696420244, now seen corresponding path program 1 times [2024-10-13 23:46:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:29,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504119467] [2024-10-13 23:46:29,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:29,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-10-13 23:46:29,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:29,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504119467] [2024-10-13 23:46:29,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504119467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:29,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:29,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:29,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654040582] [2024-10-13 23:46:29,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:29,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:29,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:29,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:29,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:29,941 INFO L87 Difference]: Start difference. First operand 11148 states and 12084 transitions. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:30,937 INFO L93 Difference]: Finished difference Result 22293 states and 24169 transitions. [2024-10-13 23:46:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:30,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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 619 [2024-10-13 23:46:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:30,951 INFO L225 Difference]: With dead ends: 22293 [2024-10-13 23:46:30,951 INFO L226 Difference]: Without dead ends: 11445 [2024-10-13 23:46:30,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:30,961 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 438 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:30,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 67 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:46:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11445 states. [2024-10-13 23:46:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11445 to 11146. [2024-10-13 23:46:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11146 states, 11145 states have (on average 1.0838941229250785) internal successors, (12080), 11145 states have internal predecessors, (12080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11146 states to 11146 states and 12080 transitions. [2024-10-13 23:46:31,149 INFO L78 Accepts]: Start accepts. Automaton has 11146 states and 12080 transitions. Word has length 619 [2024-10-13 23:46:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:31,150 INFO L471 AbstractCegarLoop]: Abstraction has 11146 states and 12080 transitions. [2024-10-13 23:46:31,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 11146 states and 12080 transitions. [2024-10-13 23:46:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2024-10-13 23:46:31,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:31,164 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:31,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:46:31,165 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:31,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2111895400, now seen corresponding path program 1 times [2024-10-13 23:46:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:31,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219611558] [2024-10-13 23:46:31,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:31,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-10-13 23:46:31,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219611558] [2024-10-13 23:46:31,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219611558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:31,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:31,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424173435] [2024-10-13 23:46:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:31,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:31,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:31,519 INFO L87 Difference]: Start difference. First operand 11146 states and 12080 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:32,563 INFO L93 Difference]: Finished difference Result 26774 states and 29118 transitions. [2024-10-13 23:46:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 641 [2024-10-13 23:46:32,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:32,580 INFO L225 Difference]: With dead ends: 26774 [2024-10-13 23:46:32,580 INFO L226 Difference]: Without dead ends: 15928 [2024-10-13 23:46:32,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:32,592 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 295 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:32,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 202 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15928 states. [2024-10-13 23:46:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15928 to 13237. [2024-10-13 23:46:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13237 states, 13236 states have (on average 1.0769114536113629) internal successors, (14254), 13236 states have internal predecessors, (14254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:32,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13237 states to 13237 states and 14254 transitions. [2024-10-13 23:46:32,797 INFO L78 Accepts]: Start accepts. Automaton has 13237 states and 14254 transitions. Word has length 641 [2024-10-13 23:46:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:32,797 INFO L471 AbstractCegarLoop]: Abstraction has 13237 states and 14254 transitions. [2024-10-13 23:46:32,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 13237 states and 14254 transitions. [2024-10-13 23:46:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2024-10-13 23:46:32,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:32,806 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:32,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:46:32,807 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:32,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2119625639, now seen corresponding path program 1 times [2024-10-13 23:46:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:32,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532329368] [2024-10-13 23:46:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-10-13 23:46:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:33,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532329368] [2024-10-13 23:46:33,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532329368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:33,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:33,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626331553] [2024-10-13 23:46:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:33,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:33,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:33,202 INFO L87 Difference]: Start difference. First operand 13237 states and 14254 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:34,219 INFO L93 Difference]: Finished difference Result 28267 states and 30579 transitions. [2024-10-13 23:46:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:34,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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 658 [2024-10-13 23:46:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:34,237 INFO L225 Difference]: With dead ends: 28267 [2024-10-13 23:46:34,237 INFO L226 Difference]: Without dead ends: 15330 [2024-10-13 23:46:34,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:34,249 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 225 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:34,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 550 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:46:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15330 states. [2024-10-13 23:46:34,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15330 to 15031. [2024-10-13 23:46:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15031 states, 15030 states have (on average 1.0629407850964738) internal successors, (15976), 15030 states have internal predecessors, (15976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:34,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15031 states to 15031 states and 15976 transitions. [2024-10-13 23:46:34,454 INFO L78 Accepts]: Start accepts. Automaton has 15031 states and 15976 transitions. Word has length 658 [2024-10-13 23:46:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:34,454 INFO L471 AbstractCegarLoop]: Abstraction has 15031 states and 15976 transitions. [2024-10-13 23:46:34,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 15031 states and 15976 transitions. [2024-10-13 23:46:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2024-10-13 23:46:34,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:34,464 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:34,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:46:34,464 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:34,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1451326036, now seen corresponding path program 1 times [2024-10-13 23:46:34,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:34,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334113475] [2024-10-13 23:46:34,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 23:46:34,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:34,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334113475] [2024-10-13 23:46:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334113475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:34,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761831146] [2024-10-13 23:46:34,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:34,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:34,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:34,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:34,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:34,941 INFO L87 Difference]: Start difference. First operand 15031 states and 15976 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:36,165 INFO L93 Difference]: Finished difference Result 33970 states and 36125 transitions. [2024-10-13 23:46:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:36,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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 660 [2024-10-13 23:46:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:36,179 INFO L225 Difference]: With dead ends: 33970 [2024-10-13 23:46:36,179 INFO L226 Difference]: Without dead ends: 19239 [2024-10-13 23:46:36,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:36,188 INFO L432 NwaCegarLoop]: 527 mSDtfsCounter, 237 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:36,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 564 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19239 states. [2024-10-13 23:46:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19239 to 18331. [2024-10-13 23:46:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18331 states, 18330 states have (on average 1.0588652482269503) internal successors, (19409), 18330 states have internal predecessors, (19409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18331 states to 18331 states and 19409 transitions. [2024-10-13 23:46:36,352 INFO L78 Accepts]: Start accepts. Automaton has 18331 states and 19409 transitions. Word has length 660 [2024-10-13 23:46:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:36,353 INFO L471 AbstractCegarLoop]: Abstraction has 18331 states and 19409 transitions. [2024-10-13 23:46:36,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18331 states and 19409 transitions. [2024-10-13 23:46:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2024-10-13 23:46:36,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:36,367 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-13 23:46:36,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:46:36,367 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:36,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -882247538, now seen corresponding path program 1 times [2024-10-13 23:46:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460011399] [2024-10-13 23:46:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:37,517 INFO L134 CoverageAnalysis]: Checked inductivity of 896 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-10-13 23:46:37,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:37,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460011399] [2024-10-13 23:46:37,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460011399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:37,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:37,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:46:37,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16146157] [2024-10-13 23:46:37,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:37,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:37,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:37,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:37,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:37,521 INFO L87 Difference]: Start difference. First operand 18331 states and 19409 transitions. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:39,001 INFO L93 Difference]: Finished difference Result 45353 states and 47880 transitions. [2024-10-13 23:46:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:39,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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 696 [2024-10-13 23:46:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:39,029 INFO L225 Difference]: With dead ends: 45353 [2024-10-13 23:46:39,029 INFO L226 Difference]: Without dead ends: 26724 [2024-10-13 23:46:39,041 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-13 23:46:39,042 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 552 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:39,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 117 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:46:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26724 states. [2024-10-13 23:46:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26724 to 18331. [2024-10-13 23:46:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18331 states, 18330 states have (on average 1.0588652482269503) internal successors, (19409), 18330 states have internal predecessors, (19409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18331 states to 18331 states and 19409 transitions. [2024-10-13 23:46:39,225 INFO L78 Accepts]: Start accepts. Automaton has 18331 states and 19409 transitions. Word has length 696 [2024-10-13 23:46:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:39,225 INFO L471 AbstractCegarLoop]: Abstraction has 18331 states and 19409 transitions. [2024-10-13 23:46:39,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 18331 states and 19409 transitions. [2024-10-13 23:46:39,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2024-10-13 23:46:39,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:39,238 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:39,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:46:39,239 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:39,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1833770987, now seen corresponding path program 1 times [2024-10-13 23:46:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864519407] [2024-10-13 23:46:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:39,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:39,941 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 23:46:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:39,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864519407] [2024-10-13 23:46:39,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864519407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:39,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:39,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:46:39,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645958058] [2024-10-13 23:46:39,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:39,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:39,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:39,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:39,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:39,947 INFO L87 Difference]: Start difference. First operand 18331 states and 19409 transitions. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:42,323 INFO L93 Difference]: Finished difference Result 46845 states and 49410 transitions. [2024-10-13 23:46:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:42,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 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 716 [2024-10-13 23:46:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:42,350 INFO L225 Difference]: With dead ends: 46845 [2024-10-13 23:46:42,350 INFO L226 Difference]: Without dead ends: 28216 [2024-10-13 23:46:42,364 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-13 23:46:42,365 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 547 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:42,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 111 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:46:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28216 states. [2024-10-13 23:46:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28216 to 23422. [2024-10-13 23:46:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23422 states, 23421 states have (on average 1.0555484394346955) internal successors, (24722), 23421 states have internal predecessors, (24722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23422 states to 23422 states and 24722 transitions. [2024-10-13 23:46:42,559 INFO L78 Accepts]: Start accepts. Automaton has 23422 states and 24722 transitions. Word has length 716 [2024-10-13 23:46:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:42,560 INFO L471 AbstractCegarLoop]: Abstraction has 23422 states and 24722 transitions. [2024-10-13 23:46:42,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 23422 states and 24722 transitions. [2024-10-13 23:46:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2024-10-13 23:46:42,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:42,571 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:46:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 23:46:42,572 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1694354697, now seen corresponding path program 1 times [2024-10-13 23:46:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:42,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846589064] [2024-10-13 23:46:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2024-10-13 23:46:43,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846589064] [2024-10-13 23:46:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846589064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:43,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114597145] [2024-10-13 23:46:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:43,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:43,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:43,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:43,356 INFO L87 Difference]: Start difference. First operand 23422 states and 24722 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:44,246 INFO L93 Difference]: Finished difference Result 46848 states and 49452 transitions. [2024-10-13 23:46:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:44,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 791 [2024-10-13 23:46:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:44,268 INFO L225 Difference]: With dead ends: 46848 [2024-10-13 23:46:44,268 INFO L226 Difference]: Without dead ends: 23726 [2024-10-13 23:46:44,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:44,281 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 293 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:44,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 120 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:46:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23726 states. [2024-10-13 23:46:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23726 to 23422. [2024-10-13 23:46:44,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23422 states, 23421 states have (on average 1.051193373468255) internal successors, (24620), 23421 states have internal predecessors, (24620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23422 states to 23422 states and 24620 transitions. [2024-10-13 23:46:44,585 INFO L78 Accepts]: Start accepts. Automaton has 23422 states and 24620 transitions. Word has length 791 [2024-10-13 23:46:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:44,586 INFO L471 AbstractCegarLoop]: Abstraction has 23422 states and 24620 transitions. [2024-10-13 23:46:44,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 23422 states and 24620 transitions. [2024-10-13 23:46:44,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2024-10-13 23:46:44,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:44,606 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:46:44,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 23:46:44,606 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash 141135099, now seen corresponding path program 1 times [2024-10-13 23:46:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:44,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851899740] [2024-10-13 23:46:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-13 23:46:45,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:45,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851899740] [2024-10-13 23:46:45,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851899740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:45,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:45,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970806154] [2024-10-13 23:46:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:45,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:45,198 INFO L87 Difference]: Start difference. First operand 23422 states and 24620 transitions. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:46,279 INFO L93 Difference]: Finished difference Result 50422 states and 52941 transitions. [2024-10-13 23:46:46,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:46,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 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 815 [2024-10-13 23:46:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:46,304 INFO L225 Difference]: With dead ends: 50422 [2024-10-13 23:46:46,304 INFO L226 Difference]: Without dead ends: 24908 [2024-10-13 23:46:46,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:46,319 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 145 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:46,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 471 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:46:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24908 states. [2024-10-13 23:46:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24908 to 23413. [2024-10-13 23:46:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23413 states, 23412 states have (on average 1.04267042542286) internal successors, (24411), 23412 states have internal predecessors, (24411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23413 states to 23413 states and 24411 transitions. [2024-10-13 23:46:46,520 INFO L78 Accepts]: Start accepts. Automaton has 23413 states and 24411 transitions. Word has length 815 [2024-10-13 23:46:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:46,520 INFO L471 AbstractCegarLoop]: Abstraction has 23413 states and 24411 transitions. [2024-10-13 23:46:46,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 23413 states and 24411 transitions. [2024-10-13 23:46:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2024-10-13 23:46:46,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:46,531 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 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] [2024-10-13 23:46:46,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 23:46:46,531 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:46,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1998903395, now seen corresponding path program 1 times [2024-10-13 23:46:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875474719] [2024-10-13 23:46:46,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 691 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-10-13 23:46:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875474719] [2024-10-13 23:46:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875474719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:47,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:47,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:46:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72808937] [2024-10-13 23:46:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:47,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:47,480 INFO L87 Difference]: Start difference. First operand 23413 states and 24411 transitions. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:48,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:48,969 INFO L93 Difference]: Finished difference Result 53718 states and 55931 transitions. [2024-10-13 23:46:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:48,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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 819 [2024-10-13 23:46:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:48,998 INFO L225 Difference]: With dead ends: 53718 [2024-10-13 23:46:48,998 INFO L226 Difference]: Without dead ends: 30007 [2024-10-13 23:46:49,014 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-13 23:46:49,015 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 535 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:49,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 120 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:46:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30007 states. [2024-10-13 23:46:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30007 to 22815. [2024-10-13 23:46:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22815 states, 22814 states have (on average 1.0432629087402472) internal successors, (23801), 22814 states have internal predecessors, (23801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22815 states to 22815 states and 23801 transitions. [2024-10-13 23:46:49,351 INFO L78 Accepts]: Start accepts. Automaton has 22815 states and 23801 transitions. Word has length 819 [2024-10-13 23:46:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:49,352 INFO L471 AbstractCegarLoop]: Abstraction has 22815 states and 23801 transitions. [2024-10-13 23:46:49,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 22815 states and 23801 transitions. [2024-10-13 23:46:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2024-10-13 23:46:49,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:49,361 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:46:49,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 23:46:49,362 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:49,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:49,362 INFO L85 PathProgramCache]: Analyzing trace with hash -186902491, now seen corresponding path program 1 times [2024-10-13 23:46:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542510512] [2024-10-13 23:46:49,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-10-13 23:46:49,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:49,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542510512] [2024-10-13 23:46:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542510512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:49,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:49,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766428989] [2024-10-13 23:46:49,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:49,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:49,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:49,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:49,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:49,887 INFO L87 Difference]: Start difference. First operand 22815 states and 23801 transitions. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 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-13 23:46:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:51,021 INFO L93 Difference]: Finished difference Result 51336 states and 53684 transitions. [2024-10-13 23:46:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:51,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 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 858 [2024-10-13 23:46:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:51,055 INFO L225 Difference]: With dead ends: 51336 [2024-10-13 23:46:51,055 INFO L226 Difference]: Without dead ends: 28821 [2024-10-13 23:46:51,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:51,071 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 135 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:51,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 234 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:51,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28821 states. [2024-10-13 23:46:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28821 to 27012. [2024-10-13 23:46:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27012 states, 27011 states have (on average 1.0435748398800488) internal successors, (28188), 27011 states have internal predecessors, (28188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27012 states to 27012 states and 28188 transitions. [2024-10-13 23:46:51,466 INFO L78 Accepts]: Start accepts. Automaton has 27012 states and 28188 transitions. Word has length 858 [2024-10-13 23:46:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:51,467 INFO L471 AbstractCegarLoop]: Abstraction has 27012 states and 28188 transitions. [2024-10-13 23:46:51,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 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-13 23:46:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 27012 states and 28188 transitions. [2024-10-13 23:46:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2024-10-13 23:46:51,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:51,481 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:46:51,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 23:46:51,481 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:51,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1712486882, now seen corresponding path program 1 times [2024-10-13 23:46:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:51,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914119541] [2024-10-13 23:46:51,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1964 backedges. 752 proven. 0 refuted. 0 times theorem prover too weak. 1212 trivial. 0 not checked. [2024-10-13 23:46:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914119541] [2024-10-13 23:46:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914119541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:52,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:52,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:46:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065618965] [2024-10-13 23:46:52,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:52,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:52,606 INFO L87 Difference]: Start difference. First operand 27012 states and 28188 transitions. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:54,206 INFO L93 Difference]: Finished difference Result 64207 states and 66846 transitions. [2024-10-13 23:46:54,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:54,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 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 992 [2024-10-13 23:46:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:54,245 INFO L225 Difference]: With dead ends: 64207 [2024-10-13 23:46:54,245 INFO L226 Difference]: Without dead ends: 37196 [2024-10-13 23:46:54,265 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-13 23:46:54,265 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 574 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:54,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 113 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:46:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37196 states. [2024-10-13 23:46:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37196 to 29705. [2024-10-13 23:46:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29705 states, 29704 states have (on average 1.0421828709938055) internal successors, (30957), 29704 states have internal predecessors, (30957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29705 states to 29705 states and 30957 transitions. [2024-10-13 23:46:54,665 INFO L78 Accepts]: Start accepts. Automaton has 29705 states and 30957 transitions. Word has length 992 [2024-10-13 23:46:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:54,666 INFO L471 AbstractCegarLoop]: Abstraction has 29705 states and 30957 transitions. [2024-10-13 23:46:54,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29705 states and 30957 transitions. [2024-10-13 23:46:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2024-10-13 23:46:54,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:54,686 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:54,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 23:46:54,686 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:54,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 473510407, now seen corresponding path program 1 times [2024-10-13 23:46:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:54,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313810235] [2024-10-13 23:46:54,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:55,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1989 backedges. 1370 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2024-10-13 23:46:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313810235] [2024-10-13 23:46:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313810235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:55,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:55,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:55,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581531539] [2024-10-13 23:46:55,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:55,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:55,093 INFO L87 Difference]: Start difference. First operand 29705 states and 30957 transitions. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:56,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:56,046 INFO L93 Difference]: Finished difference Result 61501 states and 64079 transitions. [2024-10-13 23:46:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:56,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 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 1029 [2024-10-13 23:46:56,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:56,080 INFO L225 Difference]: With dead ends: 61501 [2024-10-13 23:46:56,080 INFO L226 Difference]: Without dead ends: 32096 [2024-10-13 23:46:56,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:56,099 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 95 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:56,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 123 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:46:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32096 states. [2024-10-13 23:46:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32096 to 27910. [2024-10-13 23:46:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27910 states, 27909 states have (on average 1.0403812390268372) internal successors, (29036), 27909 states have internal predecessors, (29036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27910 states to 27910 states and 29036 transitions. [2024-10-13 23:46:56,347 INFO L78 Accepts]: Start accepts. Automaton has 27910 states and 29036 transitions. Word has length 1029 [2024-10-13 23:46:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:56,347 INFO L471 AbstractCegarLoop]: Abstraction has 27910 states and 29036 transitions. [2024-10-13 23:46:56,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 27910 states and 29036 transitions. [2024-10-13 23:46:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2024-10-13 23:46:56,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:56,364 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:56,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 23:46:56,364 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1843006611, now seen corresponding path program 1 times [2024-10-13 23:46:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479779693] [2024-10-13 23:46:56,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 655 proven. 707 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-10-13 23:46:58,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479779693] [2024-10-13 23:46:58,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479779693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:58,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059133885] [2024-10-13 23:46:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:58,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:58,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:58,172 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-13 23:46:58,173 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-13 23:46:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:58,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:46:58,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 1093 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2024-10-13 23:46:59,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:59,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059133885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:59,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:59,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 23:46:59,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121771460] [2024-10-13 23:46:59,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:59,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:59,059 INFO L87 Difference]: Start difference. First operand 27910 states and 29036 transitions. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:00,007 INFO L93 Difference]: Finished difference Result 55518 states and 57768 transitions. [2024-10-13 23:47:00,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:47:00,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 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 1030 [2024-10-13 23:47:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:00,035 INFO L225 Difference]: With dead ends: 55518 [2024-10-13 23:47:00,036 INFO L226 Difference]: Without dead ends: 27908 [2024-10-13 23:47:00,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1030 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-13 23:47:00,051 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 130 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:00,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 504 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:47:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27908 states. [2024-10-13 23:47:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27908 to 27608. [2024-10-13 23:47:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27608 states, 27607 states have (on average 1.0281088129822147) internal successors, (28383), 27607 states have internal predecessors, (28383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27608 states to 27608 states and 28383 transitions. [2024-10-13 23:47:00,285 INFO L78 Accepts]: Start accepts. Automaton has 27608 states and 28383 transitions. Word has length 1030 [2024-10-13 23:47:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:00,286 INFO L471 AbstractCegarLoop]: Abstraction has 27608 states and 28383 transitions. [2024-10-13 23:47:00,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 27608 states and 28383 transitions. [2024-10-13 23:47:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2024-10-13 23:47:00,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:00,297 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:47:00,309 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-13 23:47:00,497 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,SelfDestructingSolverStorable27 [2024-10-13 23:47:00,498 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:00,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2081865179, now seen corresponding path program 1 times [2024-10-13 23:47:00,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:00,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672163650] [2024-10-13 23:47:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 1110 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-10-13 23:47:01,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:01,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672163650] [2024-10-13 23:47:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672163650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:01,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:47:01,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:47:01,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861499080] [2024-10-13 23:47:01,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:01,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:47:01,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:01,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:47:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:01,022 INFO L87 Difference]: Start difference. First operand 27608 states and 28383 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:01,838 INFO L93 Difference]: Finished difference Result 55812 states and 57384 transitions. [2024-10-13 23:47:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:47:01,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 1059 [2024-10-13 23:47:01,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:01,865 INFO L225 Difference]: With dead ends: 55812 [2024-10-13 23:47:01,865 INFO L226 Difference]: Without dead ends: 28504 [2024-10-13 23:47:01,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:01,881 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 311 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:01,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 517 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:47:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28504 states. [2024-10-13 23:47:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28504 to 27607. [2024-10-13 23:47:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27607 states, 27606 states have (on average 1.0280736071868435) internal successors, (28381), 27606 states have internal predecessors, (28381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27607 states to 27607 states and 28381 transitions. [2024-10-13 23:47:02,134 INFO L78 Accepts]: Start accepts. Automaton has 27607 states and 28381 transitions. Word has length 1059 [2024-10-13 23:47:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:02,135 INFO L471 AbstractCegarLoop]: Abstraction has 27607 states and 28381 transitions. [2024-10-13 23:47:02,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27607 states and 28381 transitions. [2024-10-13 23:47:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2024-10-13 23:47:02,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:02,147 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:47:02,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 23:47:02,147 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:02,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:02,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1150948138, now seen corresponding path program 1 times [2024-10-13 23:47:02,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:02,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952134196] [2024-10-13 23:47:02,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:02,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2014 backedges. 1329 proven. 0 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2024-10-13 23:47:03,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:03,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952134196] [2024-10-13 23:47:03,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952134196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:03,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:47:03,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:47:03,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137889089] [2024-10-13 23:47:03,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:03,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:47:03,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:47:03,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:03,206 INFO L87 Difference]: Start difference. First operand 27607 states and 28381 transitions. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:04,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:04,396 INFO L93 Difference]: Finished difference Result 63014 states and 64794 transitions. [2024-10-13 23:47:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:47:04,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 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 1074 [2024-10-13 23:47:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:04,436 INFO L225 Difference]: With dead ends: 63014 [2024-10-13 23:47:04,436 INFO L226 Difference]: Without dead ends: 35707 [2024-10-13 23:47:04,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:04,459 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 238 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:04,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 491 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:47:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35707 states. [2024-10-13 23:47:04,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35707 to 31797. [2024-10-13 23:47:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31797 states, 31796 states have (on average 1.027739338281545) internal successors, (32678), 31796 states have internal predecessors, (32678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31797 states to 31797 states and 32678 transitions. [2024-10-13 23:47:04,882 INFO L78 Accepts]: Start accepts. Automaton has 31797 states and 32678 transitions. Word has length 1074 [2024-10-13 23:47:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:04,882 INFO L471 AbstractCegarLoop]: Abstraction has 31797 states and 32678 transitions. [2024-10-13 23:47:04,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 31797 states and 32678 transitions. [2024-10-13 23:47:04,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2024-10-13 23:47:04,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:04,896 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:47:04,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 23:47:04,897 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:04,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2053196951, now seen corresponding path program 1 times [2024-10-13 23:47:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005326501] [2024-10-13 23:47:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2189 backedges. 1177 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-13 23:47:05,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005326501] [2024-10-13 23:47:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005326501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:05,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:47:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:47:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575753976] [2024-10-13 23:47:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:05,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:47:05,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:47:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:05,506 INFO L87 Difference]: Start difference. First operand 31797 states and 32678 transitions. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:06,455 INFO L93 Difference]: Finished difference Result 68998 states and 70900 transitions. [2024-10-13 23:47:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:47:06,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 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 1116 [2024-10-13 23:47:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:06,490 INFO L225 Difference]: With dead ends: 68998 [2024-10-13 23:47:06,490 INFO L226 Difference]: Without dead ends: 37501 [2024-10-13 23:47:06,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:06,509 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 256 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:06,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 163 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:47:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37501 states. [2024-10-13 23:47:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37501 to 33898. [2024-10-13 23:47:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33898 states, 33897 states have (on average 1.0266100244859426) internal successors, (34799), 33897 states have internal predecessors, (34799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33898 states to 33898 states and 34799 transitions. [2024-10-13 23:47:06,789 INFO L78 Accepts]: Start accepts. Automaton has 33898 states and 34799 transitions. Word has length 1116 [2024-10-13 23:47:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:06,789 INFO L471 AbstractCegarLoop]: Abstraction has 33898 states and 34799 transitions. [2024-10-13 23:47:06,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33898 states and 34799 transitions. [2024-10-13 23:47:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2024-10-13 23:47:06,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:06,803 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:47:06,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 23:47:06,804 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:06,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash 903968333, now seen corresponding path program 1 times [2024-10-13 23:47:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:06,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558083448] [2024-10-13 23:47:06,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:06,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 1147 proven. 269 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-13 23:47:08,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:08,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558083448] [2024-10-13 23:47:08,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558083448] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:47:08,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729021773] [2024-10-13 23:47:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:08,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:47:08,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:47:08,398 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-13 23:47:08,400 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-13 23:47:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:08,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:47:08,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:47:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1912 backedges. 1017 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2024-10-13 23:47:09,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:47:09,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729021773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:09,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:47:09,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-13 23:47:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617521990] [2024-10-13 23:47:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:09,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:47:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:47:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:47:09,685 INFO L87 Difference]: Start difference. First operand 33898 states and 34799 transitions. Second operand has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)