./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label00.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 1908a46c2d6c2885901135dd96252b8ed820acb687d93cae536846c5c1656ef1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:18:42,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:18:42,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:18:42,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:18:42,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:18:42,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:18:42,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:18:42,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:18:42,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:18:42,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:18:42,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:18:42,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:18:42,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:18:42,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:18:42,128 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:18:42,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:18:42,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:18:42,129 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:18:42,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:18:42,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:18:42,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:18:42,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:18:42,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:18:42,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:18:42,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:18:42,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:18:42,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:18:42,135 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:18:42,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:18:42,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:18:42,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:18:42,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:18:42,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:18:42,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:18:42,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:18:42,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:18:42,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:18:42,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:18:42,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:18:42,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:18:42,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:18:42,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:18:42,140 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 -> 1908a46c2d6c2885901135dd96252b8ed820acb687d93cae536846c5c1656ef1 [2024-11-08 11:18:42,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:18:42,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:18:42,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:18:42,401 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:18:42,401 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:18:42,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label00.c [2024-11-08 11:18:43,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:18:44,375 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:18:44,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label00.c [2024-11-08 11:18:44,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a16acc1c/7c23c5be715a44cfa98dc61f404d74da/FLAGf8b6a4067 [2024-11-08 11:18:44,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a16acc1c/7c23c5be715a44cfa98dc61f404d74da [2024-11-08 11:18:44,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:18:44,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:18:44,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:18:44,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:18:44,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:18:44,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:18:44" (1/1) ... [2024-11-08 11:18:44,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5026665a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:44, skipping insertion in model container [2024-11-08 11:18:44,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:18:44" (1/1) ... [2024-11-08 11:18:44,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:18:44,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label00.c[5434,5447] [2024-11-08 11:18:45,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:18:45,612 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:18:45,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label00.c[5434,5447] [2024-11-08 11:18:46,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:18:46,156 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:18:46,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46 WrapperNode [2024-11-08 11:18:46,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:18:46,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:18:46,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:18:46,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:18:46,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:46,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:46,750 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-08 11:18:46,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:18:46,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:18:46,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:18:46,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:18:46,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:46,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:46,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:47,140 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:18:47,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:47,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:47,418 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:47,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:47,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:47,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:47,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:18:47,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:18:47,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:18:47,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:18:47,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (1/1) ... [2024-11-08 11:18:47,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:18:47,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:18:47,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:18:47,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:18:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:18:47,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:18:47,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:18:47,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:18:47,872 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:18:47,874 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:18:53,839 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-08 11:18:53,839 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:18:53,880 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:18:53,882 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:18:53,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:18:53 BoogieIcfgContainer [2024-11-08 11:18:53,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:18:53,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:18:53,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:18:53,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:18:53,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:18:44" (1/3) ... [2024-11-08 11:18:53,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5097ec0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:18:53, skipping insertion in model container [2024-11-08 11:18:53,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:18:46" (2/3) ... [2024-11-08 11:18:53,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5097ec0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:18:53, skipping insertion in model container [2024-11-08 11:18:53,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:18:53" (3/3) ... [2024-11-08 11:18:53,891 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label00.c [2024-11-08 11:18:53,908 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:18:53,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:18:54,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:18:54,015 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;@317b9c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:18:54,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:18:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:18:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 11:18:54,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:18:54,034 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] [2024-11-08 11:18:54,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:18:54,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:18:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2088660649, now seen corresponding path program 1 times [2024-11-08 11:18:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:18:54,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452035528] [2024-11-08 11:18:54,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:18:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:18:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:18:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:18:54,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:18:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452035528] [2024-11-08 11:18:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452035528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:18:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:18:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:18:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804577288] [2024-11-08 11:18:54,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:18:54,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:18:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:18:54,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:18:54,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:18:54,426 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:18:58,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:18:58,478 INFO L93 Difference]: Finished difference Result 3082 states and 5689 transitions. [2024-11-08 11:18:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:18:58,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2024-11-08 11:18:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:18:58,515 INFO L225 Difference]: With dead ends: 3082 [2024-11-08 11:18:58,515 INFO L226 Difference]: Without dead ends: 1899 [2024-11-08 11:18:58,525 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-11-08 11:18:58,529 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1002 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:18:58,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 641 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 11:18:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-11-08 11:18:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2024-11-08 11:18:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:18:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2024-11-08 11:18:58,653 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 37 [2024-11-08 11:18:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:18:58,654 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2024-11-08 11:18:58,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:18:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2024-11-08 11:18:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 11:18:58,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:18:58,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:18:58,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:18:58,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:18:58,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:18:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash 987197602, now seen corresponding path program 1 times [2024-11-08 11:18:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:18:58,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960102345] [2024-11-08 11:18:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:18:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:18:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:18:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:18:58,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:18:58,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960102345] [2024-11-08 11:18:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960102345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:18:58,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:18:58,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:18:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561207910] [2024-11-08 11:18:58,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:18:58,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:18:58,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:18:58,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:18:58,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:18:58,999 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:02,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:02,726 INFO L93 Difference]: Finished difference Result 5384 states and 9441 transitions. [2024-11-08 11:19:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:02,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-08 11:19:02,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:02,741 INFO L225 Difference]: With dead ends: 5384 [2024-11-08 11:19:02,742 INFO L226 Difference]: Without dead ends: 3492 [2024-11-08 11:19:02,746 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-11-08 11:19:02,747 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:02,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1013 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-08 11:19:02,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2024-11-08 11:19:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3491. [2024-11-08 11:19:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3490 states have (on average 1.5383954154727795) internal successors, (5369), 3490 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 5369 transitions. [2024-11-08 11:19:02,812 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 5369 transitions. Word has length 102 [2024-11-08 11:19:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:02,812 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 5369 transitions. [2024-11-08 11:19:02,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:02,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 5369 transitions. [2024-11-08 11:19:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 11:19:02,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:02,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:02,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:19:02,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:02,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash 639358663, now seen corresponding path program 1 times [2024-11-08 11:19:02,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:02,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211863067] [2024-11-08 11:19:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:02,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:03,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:03,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211863067] [2024-11-08 11:19:03,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211863067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:03,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:03,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:03,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628688493] [2024-11-08 11:19:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:03,010 INFO L87 Difference]: Start difference. First operand 3491 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:06,158 INFO L93 Difference]: Finished difference Result 10169 states and 15700 transitions. [2024-11-08 11:19:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:06,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-08 11:19:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:06,182 INFO L225 Difference]: With dead ends: 10169 [2024-11-08 11:19:06,182 INFO L226 Difference]: Without dead ends: 6680 [2024-11-08 11:19:06,188 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-11-08 11:19:06,189 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:06,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 847 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-08 11:19:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2024-11-08 11:19:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 6669. [2024-11-08 11:19:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6669 states, 6668 states have (on average 1.375224955008998) internal successors, (9170), 6668 states have internal predecessors, (9170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6669 states to 6669 states and 9170 transitions. [2024-11-08 11:19:06,321 INFO L78 Accepts]: Start accepts. Automaton has 6669 states and 9170 transitions. Word has length 104 [2024-11-08 11:19:06,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 6669 states and 9170 transitions. [2024-11-08 11:19:06,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 6669 states and 9170 transitions. [2024-11-08 11:19:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-08 11:19:06,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:06,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:06,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:19:06,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:06,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1730184235, now seen corresponding path program 1 times [2024-11-08 11:19:06,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:06,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146593688] [2024-11-08 11:19:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146593688] [2024-11-08 11:19:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146593688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:06,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:06,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:06,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980530287] [2024-11-08 11:19:06,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:06,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:06,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:06,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:06,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:06,748 INFO L87 Difference]: Start difference. First operand 6669 states and 9170 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:09,442 INFO L93 Difference]: Finished difference Result 14123 states and 19185 transitions. [2024-11-08 11:19:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-11-08 11:19:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:09,462 INFO L225 Difference]: With dead ends: 14123 [2024-11-08 11:19:09,462 INFO L226 Difference]: Without dead ends: 7456 [2024-11-08 11:19:09,471 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-11-08 11:19:09,473 INFO L432 NwaCegarLoop]: 1086 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:09,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1215 Invalid, 2577 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:19:09,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2024-11-08 11:19:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2024-11-08 11:19:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3362843729040912) internal successors, (9962), 7455 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9962 transitions. [2024-11-08 11:19:09,640 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9962 transitions. Word has length 148 [2024-11-08 11:19:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:09,642 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9962 transitions. [2024-11-08 11:19:09,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9962 transitions. [2024-11-08 11:19:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 11:19:09,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:09,645 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:09,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:19:09,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:09,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2146930175, now seen corresponding path program 1 times [2024-11-08 11:19:09,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:09,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490872101] [2024-11-08 11:19:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:09,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:09,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490872101] [2024-11-08 11:19:09,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490872101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:09,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:09,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:09,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024464081] [2024-11-08 11:19:09,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:09,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:19:09,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:09,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:19:09,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:19:09,944 INFO L87 Difference]: Start difference. First operand 7456 states and 9962 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:16,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:16,058 INFO L93 Difference]: Finished difference Result 26118 states and 35960 transitions. [2024-11-08 11:19:16,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:19:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2024-11-08 11:19:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:16,102 INFO L225 Difference]: With dead ends: 26118 [2024-11-08 11:19:16,103 INFO L226 Difference]: Without dead ends: 19451 [2024-11-08 11:19:16,113 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-11-08 11:19:16,114 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1654 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 6108 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 6757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 6108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:16,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 1071 Invalid, 6757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 6108 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-08 11:19:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19451 states. [2024-11-08 11:19:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19451 to 19303. [2024-11-08 11:19:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19303 states, 19302 states have (on average 1.2780540876593098) internal successors, (24669), 19302 states have internal predecessors, (24669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19303 states to 19303 states and 24669 transitions. [2024-11-08 11:19:16,415 INFO L78 Accepts]: Start accepts. Automaton has 19303 states and 24669 transitions. Word has length 162 [2024-11-08 11:19:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:16,416 INFO L471 AbstractCegarLoop]: Abstraction has 19303 states and 24669 transitions. [2024-11-08 11:19:16,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 19303 states and 24669 transitions. [2024-11-08 11:19:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 11:19:16,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:16,423 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:19:16,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:19:16,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:16,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2096979721, now seen corresponding path program 1 times [2024-11-08 11:19:16,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336599903] [2024-11-08 11:19:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336599903] [2024-11-08 11:19:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336599903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:16,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:16,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862283653] [2024-11-08 11:19:16,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:16,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:16,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:16,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:16,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:16,772 INFO L87 Difference]: Start difference. First operand 19303 states and 24669 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:19,929 INFO L93 Difference]: Finished difference Result 52786 states and 68383 transitions. [2024-11-08 11:19:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:19,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2024-11-08 11:19:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:19,988 INFO L225 Difference]: With dead ends: 52786 [2024-11-08 11:19:19,988 INFO L226 Difference]: Without dead ends: 34272 [2024-11-08 11:19:20,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:20,015 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 854 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 924 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 924 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:20,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 925 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [924 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 11:19:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34272 states. [2024-11-08 11:19:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34272 to 34262. [2024-11-08 11:19:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34262 states, 34261 states have (on average 1.2201920551063892) internal successors, (41805), 34261 states have internal predecessors, (41805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34262 states to 34262 states and 41805 transitions. [2024-11-08 11:19:20,481 INFO L78 Accepts]: Start accepts. Automaton has 34262 states and 41805 transitions. Word has length 244 [2024-11-08 11:19:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:20,481 INFO L471 AbstractCegarLoop]: Abstraction has 34262 states and 41805 transitions. [2024-11-08 11:19:20,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 34262 states and 41805 transitions. [2024-11-08 11:19:20,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-08 11:19:20,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:20,485 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:19:20,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:19:20,486 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1793922146, now seen corresponding path program 1 times [2024-11-08 11:19:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:20,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557482256] [2024-11-08 11:19:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:20,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-08 11:19:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557482256] [2024-11-08 11:19:20,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557482256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:20,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:19:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025958378] [2024-11-08 11:19:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:20,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:20,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:20,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:20,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:20,805 INFO L87 Difference]: Start difference. First operand 34262 states and 41805 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:23,553 INFO L93 Difference]: Finished difference Result 61438 states and 75980 transitions. [2024-11-08 11:19:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:23,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 249 [2024-11-08 11:19:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:23,605 INFO L225 Difference]: With dead ends: 61438 [2024-11-08 11:19:23,605 INFO L226 Difference]: Without dead ends: 34271 [2024-11-08 11:19:23,636 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-11-08 11:19:23,639 INFO L432 NwaCegarLoop]: 1027 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:23,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1211 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:19:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34271 states. [2024-11-08 11:19:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34271 to 34262. [2024-11-08 11:19:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34262 states, 34261 states have (on average 1.2190245468608623) internal successors, (41765), 34261 states have internal predecessors, (41765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34262 states to 34262 states and 41765 transitions. [2024-11-08 11:19:24,004 INFO L78 Accepts]: Start accepts. Automaton has 34262 states and 41765 transitions. Word has length 249 [2024-11-08 11:19:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:24,004 INFO L471 AbstractCegarLoop]: Abstraction has 34262 states and 41765 transitions. [2024-11-08 11:19:24,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 34262 states and 41765 transitions. [2024-11-08 11:19:24,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-08 11:19:24,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:24,008 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:19:24,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:19:24,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:24,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash 94841160, now seen corresponding path program 1 times [2024-11-08 11:19:24,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:24,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471530192] [2024-11-08 11:19:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:24,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:24,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:24,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471530192] [2024-11-08 11:19:24,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471530192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:24,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:24,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465077981] [2024-11-08 11:19:24,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:24,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:24,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:24,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:24,163 INFO L87 Difference]: Start difference. First operand 34262 states and 41765 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:27,653 INFO L93 Difference]: Finished difference Result 92120 states and 113613 transitions. [2024-11-08 11:19:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:27,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2024-11-08 11:19:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:27,743 INFO L225 Difference]: With dead ends: 92120 [2024-11-08 11:19:27,744 INFO L226 Difference]: Without dead ends: 57860 [2024-11-08 11:19:27,779 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-11-08 11:19:27,780 INFO L432 NwaCegarLoop]: 1671 mSDtfsCounter, 947 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:27,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1810 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-08 11:19:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57860 states. [2024-11-08 11:19:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57860 to 55488. [2024-11-08 11:19:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55488 states, 55487 states have (on average 1.184655865337827) internal successors, (65733), 55487 states have internal predecessors, (65733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55488 states to 55488 states and 65733 transitions. [2024-11-08 11:19:28,356 INFO L78 Accepts]: Start accepts. Automaton has 55488 states and 65733 transitions. Word has length 251 [2024-11-08 11:19:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:28,357 INFO L471 AbstractCegarLoop]: Abstraction has 55488 states and 65733 transitions. [2024-11-08 11:19:28,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 55488 states and 65733 transitions. [2024-11-08 11:19:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-08 11:19:28,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:28,361 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:28,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:19:28,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:28,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash 375000993, now seen corresponding path program 1 times [2024-11-08 11:19:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:28,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89944968] [2024-11-08 11:19:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:19:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89944968] [2024-11-08 11:19:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89944968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415029798] [2024-11-08 11:19:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:28,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:28,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:28,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:28,650 INFO L87 Difference]: Start difference. First operand 55488 states and 65733 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:31,778 INFO L93 Difference]: Finished difference Result 129882 states and 153032 transitions. [2024-11-08 11:19:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:31,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2024-11-08 11:19:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:31,870 INFO L225 Difference]: With dead ends: 129882 [2024-11-08 11:19:31,871 INFO L226 Difference]: Without dead ends: 75183 [2024-11-08 11:19:31,915 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-11-08 11:19:31,916 INFO L432 NwaCegarLoop]: 1334 mSDtfsCounter, 982 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 3181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:31,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1386 Invalid, 3181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:19:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75183 states. [2024-11-08 11:19:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75183 to 74375. [2024-11-08 11:19:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74375 states, 74374 states have (on average 1.1510877457175894) internal successors, (85611), 74374 states have internal predecessors, (85611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74375 states to 74375 states and 85611 transitions. [2024-11-08 11:19:32,908 INFO L78 Accepts]: Start accepts. Automaton has 74375 states and 85611 transitions. Word has length 258 [2024-11-08 11:19:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:32,909 INFO L471 AbstractCegarLoop]: Abstraction has 74375 states and 85611 transitions. [2024-11-08 11:19:32,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 74375 states and 85611 transitions. [2024-11-08 11:19:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-08 11:19:32,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:32,916 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:32,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:19:32,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:32,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1534017762, now seen corresponding path program 1 times [2024-11-08 11:19:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:32,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547612085] [2024-11-08 11:19:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-08 11:19:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547612085] [2024-11-08 11:19:33,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547612085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:33,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:33,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:33,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470427918] [2024-11-08 11:19:33,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:33,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:33,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:33,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:19:33,565 INFO L87 Difference]: Start difference. First operand 74375 states and 85611 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:37,450 INFO L93 Difference]: Finished difference Result 168434 states and 195650 transitions. [2024-11-08 11:19:37,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:37,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 333 [2024-11-08 11:19:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:37,585 INFO L225 Difference]: With dead ends: 168434 [2024-11-08 11:19:37,585 INFO L226 Difference]: Without dead ends: 94848 [2024-11-08 11:19:37,601 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-11-08 11:19:37,602 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 925 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:37,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 772 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-08 11:19:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94848 states. [2024-11-08 11:19:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94848 to 94047. [2024-11-08 11:19:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94047 states, 94046 states have (on average 1.1504370201816132) internal successors, (108194), 94046 states have internal predecessors, (108194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94047 states to 94047 states and 108194 transitions. [2024-11-08 11:19:38,983 INFO L78 Accepts]: Start accepts. Automaton has 94047 states and 108194 transitions. Word has length 333 [2024-11-08 11:19:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:38,984 INFO L471 AbstractCegarLoop]: Abstraction has 94047 states and 108194 transitions. [2024-11-08 11:19:38,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 94047 states and 108194 transitions. [2024-11-08 11:19:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-08 11:19:38,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:38,995 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:38,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:19:38,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:38,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1775816411, now seen corresponding path program 1 times [2024-11-08 11:19:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897687271] [2024-11-08 11:19:39,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:39,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 11:19:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:39,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897687271] [2024-11-08 11:19:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897687271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:39,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:19:39,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:19:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620155464] [2024-11-08 11:19:39,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:39,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:19:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:39,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:19:39,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:19:39,400 INFO L87 Difference]: Start difference. First operand 94047 states and 108194 transitions. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:45,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:45,768 INFO L93 Difference]: Finished difference Result 252041 states and 291133 transitions. [2024-11-08 11:19:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:19:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 343 [2024-11-08 11:19:45,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:45,978 INFO L225 Difference]: With dead ends: 252041 [2024-11-08 11:19:45,978 INFO L226 Difference]: Without dead ends: 158783 [2024-11-08 11:19:46,037 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-11-08 11:19:46,038 INFO L432 NwaCegarLoop]: 835 mSDtfsCounter, 1709 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 6222 mSolverCounterSat, 993 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 7215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 993 IncrementalHoareTripleChecker+Valid, 6222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:46,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1030 Invalid, 7215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [993 Valid, 6222 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-08 11:19:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158783 states. [2024-11-08 11:19:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158783 to 153933. [2024-11-08 11:19:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153933 states, 153932 states have (on average 1.1474092456409324) internal successors, (176623), 153932 states have internal predecessors, (176623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153933 states to 153933 states and 176623 transitions. [2024-11-08 11:19:48,373 INFO L78 Accepts]: Start accepts. Automaton has 153933 states and 176623 transitions. Word has length 343 [2024-11-08 11:19:48,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:48,373 INFO L471 AbstractCegarLoop]: Abstraction has 153933 states and 176623 transitions. [2024-11-08 11:19:48,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:48,373 INFO L276 IsEmpty]: Start isEmpty. Operand 153933 states and 176623 transitions. [2024-11-08 11:19:48,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-11-08 11:19:48,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:48,380 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:48,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:19:48,380 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:48,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2114247502, now seen corresponding path program 1 times [2024-11-08 11:19:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:48,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838163863] [2024-11-08 11:19:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 229 proven. 110 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 11:19:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838163863] [2024-11-08 11:19:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838163863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:19:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483156559] [2024-11-08 11:19:49,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:49,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:19:49,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:19:49,796 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-11-08 11:19:49,798 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-11-08 11:19:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:49,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:19:50,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:19:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-08 11:19:50,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:19:50,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483156559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:50,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:19:50,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-08 11:19:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85585977] [2024-11-08 11:19:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:50,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:50,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:50,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:19:50,215 INFO L87 Difference]: Start difference. First operand 153933 states and 176623 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:53,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:19:53,599 INFO L93 Difference]: Finished difference Result 304713 states and 349684 transitions. [2024-11-08 11:19:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:19:53,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 357 [2024-11-08 11:19:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:19:53,773 INFO L225 Difference]: With dead ends: 304713 [2024-11-08 11:19:53,773 INFO L226 Difference]: Without dead ends: 151569 [2024-11-08 11:19:54,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:19:54,119 INFO L432 NwaCegarLoop]: 1352 mSDtfsCounter, 1122 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:19:54,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1434 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:19:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151569 states. [2024-11-08 11:19:55,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151569 to 151568. [2024-11-08 11:19:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151568 states, 151567 states have (on average 1.1138176515996225) internal successors, (168818), 151567 states have internal predecessors, (168818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151568 states to 151568 states and 168818 transitions. [2024-11-08 11:19:55,945 INFO L78 Accepts]: Start accepts. Automaton has 151568 states and 168818 transitions. Word has length 357 [2024-11-08 11:19:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:19:55,946 INFO L471 AbstractCegarLoop]: Abstraction has 151568 states and 168818 transitions. [2024-11-08 11:19:55,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:19:55,946 INFO L276 IsEmpty]: Start isEmpty. Operand 151568 states and 168818 transitions. [2024-11-08 11:19:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2024-11-08 11:19:55,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:19:55,952 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:19:55,968 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-11-08 11:19:56,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 11:19:56,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:19:56,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:19:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash 258669050, now seen corresponding path program 1 times [2024-11-08 11:19:56,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:19:56,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596687848] [2024-11-08 11:19:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:56,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:19:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 285 proven. 110 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-08 11:19:57,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:19:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596687848] [2024-11-08 11:19:57,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596687848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:19:57,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201940363] [2024-11-08 11:19:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:19:57,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:19:57,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:19:57,782 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-11-08 11:19:57,783 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-11-08 11:19:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:19:57,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:19:57,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:19:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-08 11:19:58,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:19:58,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201940363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:19:58,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:19:58,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 11:19:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154684368] [2024-11-08 11:19:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:19:58,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:19:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:19:58,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:19:58,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:19:58,146 INFO L87 Difference]: Start difference. First operand 151568 states and 168818 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)