./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label13.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 b9aac8f1352449724c28b7a3bd33388133fcac9f460e7deaf570c372da3d5e49 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 21:24:57,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 21:24:58,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 21:24:58,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 21:24:58,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 21:24:58,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 21:24:58,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 21:24:58,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 21:24:58,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 21:24:58,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 21:24:58,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 21:24:58,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 21:24:58,059 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 21:24:58,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 21:24:58,061 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 21:24:58,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 21:24:58,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 21:24:58,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 21:24:58,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 21:24:58,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 21:24:58,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 21:24:58,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 21:24:58,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 21:24:58,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 21:24:58,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 21:24:58,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 21:24:58,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 21:24:58,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 21:24:58,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 21:24:58,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 21:24:58,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 21:24:58,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 21:24:58,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:24:58,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 21:24:58,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 21:24:58,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 21:24:58,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 21:24:58,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 21:24:58,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 21:24:58,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 21:24:58,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 21:24:58,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 21:24:58,071 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 -> b9aac8f1352449724c28b7a3bd33388133fcac9f460e7deaf570c372da3d5e49 [2024-10-23 21:24:58,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 21:24:58,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 21:24:58,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 21:24:58,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 21:24:58,404 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 21:24:58,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label13.c [2024-10-23 21:24:59,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 21:25:00,201 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 21:25:00,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label13.c [2024-10-23 21:25:00,227 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012dd9b40/176a693010b845c0b566cf422e062ef3/FLAG9aab28184 [2024-10-23 21:25:00,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/012dd9b40/176a693010b845c0b566cf422e062ef3 [2024-10-23 21:25:00,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 21:25:00,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 21:25:00,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 21:25:00,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 21:25:00,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 21:25:00,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:25:00" (1/1) ... [2024-10-23 21:25:00,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1a953e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:00, skipping insertion in model container [2024-10-23 21:25:00,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 09:25:00" (1/1) ... [2024-10-23 21:25:00,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 21:25:00,614 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label13.c[5905,5918] [2024-10-23 21:25:00,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:25:00,957 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 21:25:00,986 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label13.c[5905,5918] [2024-10-23 21:25:01,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 21:25:01,251 INFO L204 MainTranslator]: Completed translation [2024-10-23 21:25:01,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01 WrapperNode [2024-10-23 21:25:01,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 21:25:01,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 21:25:01,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 21:25:01,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 21:25:01,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,396 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-23 21:25:01,397 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 21:25:01,397 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 21:25:01,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 21:25:01,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 21:25:01,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,545 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 21:25:01,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 21:25:01,694 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 21:25:01,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 21:25:01,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 21:25:01,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (1/1) ... [2024-10-23 21:25:01,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 21:25:01,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:25:01,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 21:25:01,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 21:25:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 21:25:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 21:25:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 21:25:01,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 21:25:01,857 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 21:25:01,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 21:25:03,865 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-23 21:25:03,865 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 21:25:03,961 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 21:25:03,963 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 21:25:03,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:25:03 BoogieIcfgContainer [2024-10-23 21:25:03,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 21:25:03,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 21:25:03,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 21:25:03,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 21:25:03,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 09:25:00" (1/3) ... [2024-10-23 21:25:03,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45186172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:25:03, skipping insertion in model container [2024-10-23 21:25:03,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 09:25:01" (2/3) ... [2024-10-23 21:25:03,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45186172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 09:25:03, skipping insertion in model container [2024-10-23 21:25:03,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:25:03" (3/3) ... [2024-10-23 21:25:03,973 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label13.c [2024-10-23 21:25:03,989 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 21:25:03,990 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 21:25:04,074 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 21:25:04,082 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;@5ca9c227, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 21:25:04,083 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 21:25:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:04,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-23 21:25:04,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:04,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:04,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:04,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:04,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2051635919, now seen corresponding path program 1 times [2024-10-23 21:25:04,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:04,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520768809] [2024-10-23 21:25:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:25:04,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:04,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520768809] [2024-10-23 21:25:04,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520768809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:04,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:04,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:25:04,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665087726] [2024-10-23 21:25:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:04,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 21:25:04,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 21:25:04,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:25:04,322 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:04,395 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-23 21:25:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 21:25:04,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-23 21:25:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:04,420 INFO L225 Difference]: With dead ends: 667 [2024-10-23 21:25:04,420 INFO L226 Difference]: Without dead ends: 332 [2024-10-23 21:25:04,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 21:25:04,431 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:04,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 21:25:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-23 21:25:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-23 21:25:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-23 21:25:04,499 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 55 [2024-10-23 21:25:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:04,500 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-23 21:25:04,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-23 21:25:04,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-23 21:25:04,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:04,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:04,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 21:25:04,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:04,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:04,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1994747926, now seen corresponding path program 1 times [2024-10-23 21:25:04,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:04,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922645914] [2024-10-23 21:25:04,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:04,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:25:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922645914] [2024-10-23 21:25:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922645914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:04,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:25:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365030167] [2024-10-23 21:25:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:04,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:04,752 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:06,275 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-23 21:25:06,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:06,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-23 21:25:06,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:06,280 INFO L225 Difference]: With dead ends: 992 [2024-10-23 21:25:06,280 INFO L226 Difference]: Without dead ends: 661 [2024-10-23 21:25:06,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:06,283 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 315 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:06,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 199 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-23 21:25:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-23 21:25:06,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-23 21:25:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5196969696969698) internal successors, (1003), 660 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1003 transitions. [2024-10-23 21:25:06,322 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1003 transitions. Word has length 55 [2024-10-23 21:25:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:06,322 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1003 transitions. [2024-10-23 21:25:06,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1003 transitions. [2024-10-23 21:25:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-23 21:25:06,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25: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, 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] [2024-10-23 21:25:06,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 21:25:06,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:06,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:06,328 INFO L85 PathProgramCache]: Analyzing trace with hash 96262832, now seen corresponding path program 1 times [2024-10-23 21:25:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:06,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118676053] [2024-10-23 21:25:06,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:06,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:25:06,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:06,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118676053] [2024-10-23 21:25:06,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118676053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:06,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:06,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:25:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360973316] [2024-10-23 21:25:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:06,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:06,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:06,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:06,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:06,674 INFO L87 Difference]: Start difference. First operand 661 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:08,065 INFO L93 Difference]: Finished difference Result 1979 states and 3006 transitions. [2024-10-23 21:25:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:08,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-10-23 21:25:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:08,071 INFO L225 Difference]: With dead ends: 1979 [2024-10-23 21:25:08,071 INFO L226 Difference]: Without dead ends: 1319 [2024-10-23 21:25:08,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:08,074 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:08,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 215 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:25:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-23 21:25:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-23 21:25:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.4559939301972686) internal successors, (1919), 1318 states have internal predecessors, (1919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1919 transitions. [2024-10-23 21:25:08,115 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1919 transitions. Word has length 123 [2024-10-23 21:25:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:08,115 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1919 transitions. [2024-10-23 21:25:08,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1919 transitions. [2024-10-23 21:25:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-23 21:25:08,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:08,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:25:08,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 21:25:08,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:08,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash -964622895, now seen corresponding path program 1 times [2024-10-23 21:25:08,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:08,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147207123] [2024-10-23 21:25:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:08,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:25:08,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:08,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147207123] [2024-10-23 21:25:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147207123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:08,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:08,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:25:08,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477262197] [2024-10-23 21:25:08,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:08,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:08,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:08,301 INFO L87 Difference]: Start difference. First operand 1319 states and 1919 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:09,736 INFO L93 Difference]: Finished difference Result 3953 states and 5754 transitions. [2024-10-23 21:25:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:09,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-10-23 21:25:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:09,751 INFO L225 Difference]: With dead ends: 3953 [2024-10-23 21:25:09,751 INFO L226 Difference]: Without dead ends: 2635 [2024-10-23 21:25:09,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:09,754 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:09,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 153 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:25:09,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-23 21:25:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2024-10-23 21:25:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.3242217160212604) internal successors, (3488), 2634 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3488 transitions. [2024-10-23 21:25:09,805 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3488 transitions. Word has length 134 [2024-10-23 21:25:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:09,805 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3488 transitions. [2024-10-23 21:25:09,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3488 transitions. [2024-10-23 21:25:09,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-10-23 21:25:09,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:09,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:09,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 21:25:09,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:09,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:09,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1733865202, now seen corresponding path program 1 times [2024-10-23 21:25:09,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:09,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730785666] [2024-10-23 21:25:09,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:09,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 21:25:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:10,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730785666] [2024-10-23 21:25:10,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730785666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:10,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:10,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 21:25:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758421619] [2024-10-23 21:25:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:10,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:10,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:10,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:10,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:10,044 INFO L87 Difference]: Start difference. First operand 2635 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:11,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:11,307 INFO L93 Difference]: Finished difference Result 6585 states and 8544 transitions. [2024-10-23 21:25:11,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:11,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 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 252 [2024-10-23 21:25:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:11,322 INFO L225 Difference]: With dead ends: 6585 [2024-10-23 21:25:11,322 INFO L226 Difference]: Without dead ends: 3951 [2024-10-23 21:25:11,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:11,328 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:11,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 82 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-23 21:25:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-23 21:25:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-23 21:25:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.2164556962025317) internal successors, (4805), 3950 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4805 transitions. [2024-10-23 21:25:11,401 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4805 transitions. Word has length 252 [2024-10-23 21:25:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:11,403 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4805 transitions. [2024-10-23 21:25:11,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4805 transitions. [2024-10-23 21:25:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-10-23 21:25:11,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:11,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:11,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 21:25:11,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:11,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash 987571122, now seen corresponding path program 1 times [2024-10-23 21:25:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:11,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576365233] [2024-10-23 21:25:11,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:11,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:25:12,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:12,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576365233] [2024-10-23 21:25:12,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576365233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:12,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:12,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088435182] [2024-10-23 21:25:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:12,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:25:12,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:25:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:25:12,089 INFO L87 Difference]: Start difference. First operand 3951 states and 4805 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:13,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:13,498 INFO L93 Difference]: Finished difference Result 8230 states and 9950 transitions. [2024-10-23 21:25:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:25:13,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 300 [2024-10-23 21:25:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:13,516 INFO L225 Difference]: With dead ends: 8230 [2024-10-23 21:25:13,517 INFO L226 Difference]: Without dead ends: 4280 [2024-10-23 21:25:13,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:25:13,525 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 127 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:13,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 318 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-23 21:25:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4280 states. [2024-10-23 21:25:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4280 to 4280. [2024-10-23 21:25:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4280 states, 4279 states have (on average 1.2012152372049545) internal successors, (5140), 4279 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4280 states to 4280 states and 5140 transitions. [2024-10-23 21:25:13,671 INFO L78 Accepts]: Start accepts. Automaton has 4280 states and 5140 transitions. Word has length 300 [2024-10-23 21:25:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:13,676 INFO L471 AbstractCegarLoop]: Abstraction has 4280 states and 5140 transitions. [2024-10-23 21:25:13,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 4280 states and 5140 transitions. [2024-10-23 21:25:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2024-10-23 21:25:13,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:13,682 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:13,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 21:25:13,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:13,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1516659093, now seen corresponding path program 1 times [2024-10-23 21:25:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371120157] [2024-10-23 21:25:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 21:25:14,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:14,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371120157] [2024-10-23 21:25:14,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371120157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:14,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:14,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 21:25:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280043494] [2024-10-23 21:25:14,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:14,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-23 21:25:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:14,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-23 21:25:14,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:25:14,372 INFO L87 Difference]: Start difference. First operand 4280 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 6 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:16,255 INFO L93 Difference]: Finished difference Result 8089 states and 9791 transitions. [2024-10-23 21:25:16,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 21:25:16,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 6 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 387 [2024-10-23 21:25:16,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:16,266 INFO L225 Difference]: With dead ends: 8089 [2024-10-23 21:25:16,266 INFO L226 Difference]: Without dead ends: 3951 [2024-10-23 21:25:16,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:25:16,273 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 295 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:16,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 293 Invalid, 2610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-23 21:25:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2024-10-23 21:25:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3951. [2024-10-23 21:25:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3951 states, 3950 states have (on average 1.080253164556962) internal successors, (4267), 3950 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 4267 transitions. [2024-10-23 21:25:16,332 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 4267 transitions. Word has length 387 [2024-10-23 21:25:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:16,332 INFO L471 AbstractCegarLoop]: Abstraction has 3951 states and 4267 transitions. [2024-10-23 21:25:16,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.285714285714285) internal successors, (387), 6 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 4267 transitions. [2024-10-23 21:25:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-10-23 21:25:16,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:16,338 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:16,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 21:25:16,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:16,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash -89051573, now seen corresponding path program 1 times [2024-10-23 21:25:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:16,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513425467] [2024-10-23 21:25:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-23 21:25:16,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:16,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513425467] [2024-10-23 21:25:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513425467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:16,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:16,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:16,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200056108] [2024-10-23 21:25:16,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:16,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:16,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:16,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:16,664 INFO L87 Difference]: Start difference. First operand 3951 states and 4267 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:17,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:17,617 INFO L93 Difference]: Finished difference Result 9546 states and 10413 transitions. [2024-10-23 21:25:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 394 [2024-10-23 21:25:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:17,634 INFO L225 Difference]: With dead ends: 9546 [2024-10-23 21:25:17,634 INFO L226 Difference]: Without dead ends: 5925 [2024-10-23 21:25:17,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:17,639 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 292 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:17,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 38 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:25:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2024-10-23 21:25:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5925. [2024-10-23 21:25:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5925 states, 5924 states have (on average 1.0828831870357867) internal successors, (6415), 5924 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5925 states to 5925 states and 6415 transitions. [2024-10-23 21:25:17,717 INFO L78 Accepts]: Start accepts. Automaton has 5925 states and 6415 transitions. Word has length 394 [2024-10-23 21:25:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:17,718 INFO L471 AbstractCegarLoop]: Abstraction has 5925 states and 6415 transitions. [2024-10-23 21:25:17,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5925 states and 6415 transitions. [2024-10-23 21:25:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-10-23 21:25:17,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:17,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:25:17,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 21:25:17,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:17,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash 364606169, now seen corresponding path program 1 times [2024-10-23 21:25:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:17,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408925580] [2024-10-23 21:25:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-10-23 21:25:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408925580] [2024-10-23 21:25:18,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408925580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:25:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632545058] [2024-10-23 21:25:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:18,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:25:18,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:25:18,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:25:18,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 21:25:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:18,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 21:25:18,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:25:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-10-23 21:25:19,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:25:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632545058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:19,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:25:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-23 21:25:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2213171] [2024-10-23 21:25:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:19,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:19,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:19,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:25:19,331 INFO L87 Difference]: Start difference. First operand 5925 states and 6415 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:20,028 INFO L93 Difference]: Finished difference Result 7572 states and 8111 transitions. [2024-10-23 21:25:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:20,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 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 511 [2024-10-23 21:25:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:20,051 INFO L225 Difference]: With dead ends: 7572 [2024-10-23 21:25:20,051 INFO L226 Difference]: Without dead ends: 7570 [2024-10-23 21:25:20,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 21:25:20,055 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:20,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 81 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:25:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7570 states. [2024-10-23 21:25:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7570 to 6254. [2024-10-23 21:25:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.0806013113705422) internal successors, (6757), 6253 states have internal predecessors, (6757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6757 transitions. [2024-10-23 21:25:20,153 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6757 transitions. Word has length 511 [2024-10-23 21:25:20,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:20,154 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6757 transitions. [2024-10-23 21:25:20,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6757 transitions. [2024-10-23 21:25:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2024-10-23 21:25:20,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:20,183 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:20,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-23 21:25:20,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:25:20,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:20,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash -992764503, now seen corresponding path program 1 times [2024-10-23 21:25:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:20,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882799281] [2024-10-23 21:25:20,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:20,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1481 backedges. 1078 proven. 0 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-10-23 21:25:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882799281] [2024-10-23 21:25:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882799281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:21,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315549973] [2024-10-23 21:25:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:21,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:25:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:25:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:25:21,438 INFO L87 Difference]: Start difference. First operand 6254 states and 6757 transitions. Second operand has 4 states, 4 states have (on average 169.5) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:22,885 INFO L93 Difference]: Finished difference Result 16455 states and 17846 transitions. [2024-10-23 21:25:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 21:25:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 169.5) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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 905 [2024-10-23 21:25:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:22,902 INFO L225 Difference]: With dead ends: 16455 [2024-10-23 21:25:22,903 INFO L226 Difference]: Without dead ends: 10531 [2024-10-23 21:25:22,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:25:22,909 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 186 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:22,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 91 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-23 21:25:22,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10531 states. [2024-10-23 21:25:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10531 to 10531. [2024-10-23 21:25:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 1.0784425451092117) internal successors, (11356), 10530 states have internal predecessors, (11356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 11356 transitions. [2024-10-23 21:25:23,049 INFO L78 Accepts]: Start accepts. Automaton has 10531 states and 11356 transitions. Word has length 905 [2024-10-23 21:25:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:23,051 INFO L471 AbstractCegarLoop]: Abstraction has 10531 states and 11356 transitions. [2024-10-23 21:25:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.5) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 10531 states and 11356 transitions. [2024-10-23 21:25:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 944 [2024-10-23 21:25:23,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:23,070 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:25:23,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 21:25:23,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:23,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1550718364, now seen corresponding path program 1 times [2024-10-23 21:25:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:23,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373165038] [2024-10-23 21:25:23,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:23,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 1214 proven. 0 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2024-10-23 21:25:24,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:24,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373165038] [2024-10-23 21:25:24,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373165038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:24,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:24,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:24,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119076544] [2024-10-23 21:25:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:24,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 21:25:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:24,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 21:25:24,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:25:24,353 INFO L87 Difference]: Start difference. First operand 10531 states and 11356 transitions. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:25,281 INFO L93 Difference]: Finished difference Result 20403 states and 22044 transitions. [2024-10-23 21:25:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 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 943 [2024-10-23 21:25:25,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:25,300 INFO L225 Difference]: With dead ends: 20403 [2024-10-23 21:25:25,300 INFO L226 Difference]: Without dead ends: 10531 [2024-10-23 21:25:25,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 21:25:25,311 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:25,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 116 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 21:25:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10531 states. [2024-10-23 21:25:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10531 to 10531. [2024-10-23 21:25:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10531 states, 10530 states have (on average 1.0781576448243115) internal successors, (11353), 10530 states have internal predecessors, (11353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10531 states to 10531 states and 11353 transitions. [2024-10-23 21:25:25,438 INFO L78 Accepts]: Start accepts. Automaton has 10531 states and 11353 transitions. Word has length 943 [2024-10-23 21:25:25,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:25,438 INFO L471 AbstractCegarLoop]: Abstraction has 10531 states and 11353 transitions. [2024-10-23 21:25:25,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 3 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 10531 states and 11353 transitions. [2024-10-23 21:25:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1005 [2024-10-23 21:25:25,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:25,456 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:25,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 21:25:25,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash -286517598, now seen corresponding path program 1 times [2024-10-23 21:25:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:25,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787925867] [2024-10-23 21:25:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:25,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2069 backedges. 1354 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-10-23 21:25:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:26,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787925867] [2024-10-23 21:25:26,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787925867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:26,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:26,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305767722] [2024-10-23 21:25:26,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:26,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:26,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:26,207 INFO L87 Difference]: Start difference. First operand 10531 states and 11353 transitions. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:27,074 INFO L93 Difference]: Finished difference Result 23035 states and 24994 transitions. [2024-10-23 21:25:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:27,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 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 1004 [2024-10-23 21:25:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:27,096 INFO L225 Difference]: With dead ends: 23035 [2024-10-23 21:25:27,096 INFO L226 Difference]: Without dead ends: 13163 [2024-10-23 21:25:27,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:27,108 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 222 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:27,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 432 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-23 21:25:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-23 21:25:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 13163. [2024-10-23 21:25:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0643519222002735) internal successors, (14009), 13162 states have internal predecessors, (14009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 14009 transitions. [2024-10-23 21:25:27,277 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 14009 transitions. Word has length 1004 [2024-10-23 21:25:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:27,278 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 14009 transitions. [2024-10-23 21:25:27,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 14009 transitions. [2024-10-23 21:25:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2024-10-23 21:25:27,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:27,297 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:27,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 21:25:27,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash -512842079, now seen corresponding path program 1 times [2024-10-23 21:25:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516236533] [2024-10-23 21:25:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2074 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-10-23 21:25:28,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:28,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516236533] [2024-10-23 21:25:28,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516236533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:28,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:28,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352291326] [2024-10-23 21:25:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:28,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:28,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:28,685 INFO L87 Difference]: Start difference. First operand 13163 states and 14009 transitions. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:29,494 INFO L93 Difference]: Finished difference Result 25996 states and 27686 transitions. [2024-10-23 21:25:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 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 1005 [2024-10-23 21:25:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:29,515 INFO L225 Difference]: With dead ends: 25996 [2024-10-23 21:25:29,515 INFO L226 Difference]: Without dead ends: 13163 [2024-10-23 21:25:29,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:29,529 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 148 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:29,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 364 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:25:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13163 states. [2024-10-23 21:25:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13163 to 12505. [2024-10-23 21:25:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.0499040307101728) internal successors, (13128), 12504 states have internal predecessors, (13128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 13128 transitions. [2024-10-23 21:25:29,678 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 13128 transitions. Word has length 1005 [2024-10-23 21:25:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 13128 transitions. [2024-10-23 21:25:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 13128 transitions. [2024-10-23 21:25:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2024-10-23 21:25:29,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:29,701 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 21:25:29,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:29,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash -475073800, now seen corresponding path program 1 times [2024-10-23 21:25:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:29,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903252367] [2024-10-23 21:25:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 972 proven. 0 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-10-23 21:25:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903252367] [2024-10-23 21:25:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903252367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:30,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:30,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421128348] [2024-10-23 21:25:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:30,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:30,373 INFO L87 Difference]: Start difference. First operand 12505 states and 13128 transitions. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:31,096 INFO L93 Difference]: Finished difference Result 29286 states and 30817 transitions. [2024-10-23 21:25:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:31,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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 1019 [2024-10-23 21:25:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:31,116 INFO L225 Difference]: With dead ends: 29286 [2024-10-23 21:25:31,116 INFO L226 Difference]: Without dead ends: 16124 [2024-10-23 21:25:31,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:31,179 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:31,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 425 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:25:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-23 21:25:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 15795. [2024-10-23 21:25:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15795 states, 15794 states have (on average 1.0384956312523743) internal successors, (16402), 15794 states have internal predecessors, (16402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15795 states to 15795 states and 16402 transitions. [2024-10-23 21:25:31,352 INFO L78 Accepts]: Start accepts. Automaton has 15795 states and 16402 transitions. Word has length 1019 [2024-10-23 21:25:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:31,353 INFO L471 AbstractCegarLoop]: Abstraction has 15795 states and 16402 transitions. [2024-10-23 21:25:31,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 15795 states and 16402 transitions. [2024-10-23 21:25:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2024-10-23 21:25:31,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:31,371 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-23 21:25:31,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 21:25:31,372 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:31,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1710473633, now seen corresponding path program 1 times [2024-10-23 21:25:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477175240] [2024-10-23 21:25:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 1817 trivial. 0 not checked. [2024-10-23 21:25:32,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:32,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477175240] [2024-10-23 21:25:32,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477175240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:32,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:32,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125523788] [2024-10-23 21:25:32,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:32,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:32,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:32,033 INFO L87 Difference]: Start difference. First operand 15795 states and 16402 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:32,830 INFO L93 Difference]: Finished difference Result 31260 states and 32471 transitions. [2024-10-23 21:25:32,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:32,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1057 [2024-10-23 21:25:32,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:32,850 INFO L225 Difference]: With dead ends: 31260 [2024-10-23 21:25:32,851 INFO L226 Difference]: Without dead ends: 15795 [2024-10-23 21:25:32,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:32,863 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 279 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:32,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 424 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:25:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2024-10-23 21:25:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 15137. [2024-10-23 21:25:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15137 states, 15136 states have (on average 1.0307875264270614) internal successors, (15602), 15136 states have internal predecessors, (15602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:33,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15137 states to 15137 states and 15602 transitions. [2024-10-23 21:25:33,064 INFO L78 Accepts]: Start accepts. Automaton has 15137 states and 15602 transitions. Word has length 1057 [2024-10-23 21:25:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:33,065 INFO L471 AbstractCegarLoop]: Abstraction has 15137 states and 15602 transitions. [2024-10-23 21:25:33,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15137 states and 15602 transitions. [2024-10-23 21:25:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2024-10-23 21:25:33,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:33,084 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 21:25:33,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-23 21:25:33,085 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:33,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash 142147290, now seen corresponding path program 1 times [2024-10-23 21:25:33,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:33,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547678354] [2024-10-23 21:25:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:33,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2140 backedges. 1024 proven. 0 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2024-10-23 21:25:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:34,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547678354] [2024-10-23 21:25:34,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547678354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:34,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:34,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002365829] [2024-10-23 21:25:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:34,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:34,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:34,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:34,282 INFO L87 Difference]: Start difference. First operand 15137 states and 15602 transitions. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:34,940 INFO L93 Difference]: Finished difference Result 29615 states and 30541 transitions. [2024-10-23 21:25:34,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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 1130 [2024-10-23 21:25:34,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:34,958 INFO L225 Difference]: With dead ends: 29615 [2024-10-23 21:25:34,958 INFO L226 Difference]: Without dead ends: 15137 [2024-10-23 21:25:34,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:34,969 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:34,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 374 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:25:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15137 states. [2024-10-23 21:25:35,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15137 to 14808. [2024-10-23 21:25:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0274194637671372) internal successors, (15213), 14807 states have internal predecessors, (15213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15213 transitions. [2024-10-23 21:25:35,141 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15213 transitions. Word has length 1130 [2024-10-23 21:25:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:35,143 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15213 transitions. [2024-10-23 21:25:35,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15213 transitions. [2024-10-23 21:25:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1250 [2024-10-23 21:25:35,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:35,166 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:35,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-23 21:25:35,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:35,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:35,167 INFO L85 PathProgramCache]: Analyzing trace with hash -629711545, now seen corresponding path program 1 times [2024-10-23 21:25:35,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:35,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332313671] [2024-10-23 21:25:35,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:35,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3598 backedges. 2322 proven. 0 refuted. 0 times theorem prover too weak. 1276 trivial. 0 not checked. [2024-10-23 21:25:35,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:35,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332313671] [2024-10-23 21:25:35,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332313671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:35,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:35,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809198371] [2024-10-23 21:25:35,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:35,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:35,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:35,769 INFO L87 Difference]: Start difference. First operand 14808 states and 15213 transitions. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:36,441 INFO L93 Difference]: Finished difference Result 30273 states and 31126 transitions. [2024-10-23 21:25:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:36,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 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 1249 [2024-10-23 21:25:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:36,457 INFO L225 Difference]: With dead ends: 30273 [2024-10-23 21:25:36,457 INFO L226 Difference]: Without dead ends: 16124 [2024-10-23 21:25:36,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:36,469 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:36,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 422 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:25:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-23 21:25:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 16124. [2024-10-23 21:25:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0236308379333872) internal successors, (16504), 16123 states have internal predecessors, (16504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16504 transitions. [2024-10-23 21:25:36,653 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16504 transitions. Word has length 1249 [2024-10-23 21:25:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:36,654 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16504 transitions. [2024-10-23 21:25:36,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16504 transitions. [2024-10-23 21:25:36,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1337 [2024-10-23 21:25:36,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:36,674 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:36,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-23 21:25:36,675 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:36,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:36,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1071341285, now seen corresponding path program 1 times [2024-10-23 21:25:36,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:36,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050814672] [2024-10-23 21:25:36,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:36,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 1447 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2024-10-23 21:25:37,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:37,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050814672] [2024-10-23 21:25:37,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050814672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:37,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:37,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:37,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912172159] [2024-10-23 21:25:37,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:37,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:37,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:37,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:37,603 INFO L87 Difference]: Start difference. First operand 16124 states and 16504 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:38,349 INFO L93 Difference]: Finished difference Result 34550 states and 35439 transitions. [2024-10-23 21:25:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:38,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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 1336 [2024-10-23 21:25:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:38,368 INFO L225 Difference]: With dead ends: 34550 [2024-10-23 21:25:38,368 INFO L226 Difference]: Without dead ends: 16782 [2024-10-23 21:25:38,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:38,382 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 147 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:38,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 410 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:25:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16782 states. [2024-10-23 21:25:38,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16782 to 16782. [2024-10-23 21:25:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16782 states, 16781 states have (on average 1.0227042488528693) internal successors, (17162), 16781 states have internal predecessors, (17162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16782 states to 16782 states and 17162 transitions. [2024-10-23 21:25:38,548 INFO L78 Accepts]: Start accepts. Automaton has 16782 states and 17162 transitions. Word has length 1336 [2024-10-23 21:25:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:38,549 INFO L471 AbstractCegarLoop]: Abstraction has 16782 states and 17162 transitions. [2024-10-23 21:25:38,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:38,550 INFO L276 IsEmpty]: Start isEmpty. Operand 16782 states and 17162 transitions. [2024-10-23 21:25:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1451 [2024-10-23 21:25:38,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:38,571 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:38,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-23 21:25:38,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:38,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1478150862, now seen corresponding path program 1 times [2024-10-23 21:25:38,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:38,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512164206] [2024-10-23 21:25:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3950 backedges. 431 proven. 0 refuted. 0 times theorem prover too weak. 3519 trivial. 0 not checked. [2024-10-23 21:25:39,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:39,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512164206] [2024-10-23 21:25:39,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512164206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:39,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:39,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 21:25:39,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908653582] [2024-10-23 21:25:39,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:39,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 21:25:39,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:39,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 21:25:39,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:25:39,549 INFO L87 Difference]: Start difference. First operand 16782 states and 17162 transitions. Second operand has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:40,150 INFO L93 Difference]: Finished difference Result 32671 states and 33423 transitions. [2024-10-23 21:25:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 21:25:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 0 states have call successors, (0), 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 1450 [2024-10-23 21:25:40,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:40,165 INFO L225 Difference]: With dead ends: 32671 [2024-10-23 21:25:40,166 INFO L226 Difference]: Without dead ends: 16453 [2024-10-23 21:25:40,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-23 21:25:40,175 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:40,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 448 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 21:25:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2024-10-23 21:25:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 14479. [2024-10-23 21:25:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14479 states, 14478 states have (on average 1.0221715706589307) internal successors, (14799), 14478 states have internal predecessors, (14799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:40,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 14799 transitions. [2024-10-23 21:25:40,390 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 14799 transitions. Word has length 1450 [2024-10-23 21:25:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:40,391 INFO L471 AbstractCegarLoop]: Abstraction has 14479 states and 14799 transitions. [2024-10-23 21:25:40,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 6 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 14799 transitions. [2024-10-23 21:25:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1828 [2024-10-23 21:25:40,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:40,426 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 21:25:40,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-23 21:25:40,427 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:40,428 INFO L85 PathProgramCache]: Analyzing trace with hash -138555117, now seen corresponding path program 1 times [2024-10-23 21:25:40,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:40,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028433497] [2024-10-23 21:25:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5655 backedges. 3883 proven. 152 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2024-10-23 21:25:43,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028433497] [2024-10-23 21:25:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028433497] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:25:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842160366] [2024-10-23 21:25:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:43,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:25:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:25:43,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:25:43,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 21:25:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:43,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 2067 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:25:43,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:25:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5655 backedges. 3611 proven. 0 refuted. 0 times theorem prover too weak. 2044 trivial. 0 not checked. [2024-10-23 21:25:43,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:25:43,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842160366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:43,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:25:43,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-23 21:25:43,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134744250] [2024-10-23 21:25:43,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:43,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:43,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:43,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:25:43,871 INFO L87 Difference]: Start difference. First operand 14479 states and 14799 transitions. Second operand has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:44,563 INFO L93 Difference]: Finished difference Result 28299 states and 28935 transitions. [2024-10-23 21:25:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:44,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 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 1827 [2024-10-23 21:25:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:44,576 INFO L225 Difference]: With dead ends: 28299 [2024-10-23 21:25:44,576 INFO L226 Difference]: Without dead ends: 14479 [2024-10-23 21:25:44,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1834 GetRequests, 1829 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:25:44,584 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 123 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:44,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 404 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:25:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2024-10-23 21:25:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 13821. [2024-10-23 21:25:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.020260492040521) internal successors, (14100), 13820 states have internal predecessors, (14100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:44,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14100 transitions. [2024-10-23 21:25:44,694 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14100 transitions. Word has length 1827 [2024-10-23 21:25:44,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:44,695 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14100 transitions. [2024-10-23 21:25:44,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:44,695 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14100 transitions. [2024-10-23 21:25:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1876 [2024-10-23 21:25:44,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:44,725 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:44,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-23 21:25:44,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-10-23 21:25:44,926 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:44,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2030890314, now seen corresponding path program 1 times [2024-10-23 21:25:44,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:44,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678891051] [2024-10-23 21:25:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6875 backedges. 4154 proven. 0 refuted. 0 times theorem prover too weak. 2721 trivial. 0 not checked. [2024-10-23 21:25:46,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678891051] [2024-10-23 21:25:46,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678891051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:46,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:46,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:46,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80852219] [2024-10-23 21:25:46,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:46,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:46,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:46,379 INFO L87 Difference]: Start difference. First operand 13821 states and 14100 transitions. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:47,093 INFO L93 Difference]: Finished difference Result 27312 states and 27874 transitions. [2024-10-23 21:25:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:47,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 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 1875 [2024-10-23 21:25:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:47,107 INFO L225 Difference]: With dead ends: 27312 [2024-10-23 21:25:47,108 INFO L226 Difference]: Without dead ends: 14150 [2024-10-23 21:25:47,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:47,117 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 224 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:47,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 425 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:25:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2024-10-23 21:25:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 14150. [2024-10-23 21:25:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 14149 states have (on average 1.0199307371545692) internal successors, (14431), 14149 states have internal predecessors, (14431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 14431 transitions. [2024-10-23 21:25:47,224 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 14431 transitions. Word has length 1875 [2024-10-23 21:25:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:47,225 INFO L471 AbstractCegarLoop]: Abstraction has 14150 states and 14431 transitions. [2024-10-23 21:25:47,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 14431 transitions. [2024-10-23 21:25:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1899 [2024-10-23 21:25:47,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:47,249 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:47,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-23 21:25:47,250 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:47,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1186653679, now seen corresponding path program 1 times [2024-10-23 21:25:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905161367] [2024-10-23 21:25:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6692 backedges. 3474 proven. 0 refuted. 0 times theorem prover too weak. 3218 trivial. 0 not checked. [2024-10-23 21:25:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905161367] [2024-10-23 21:25:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905161367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:48,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:48,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836090075] [2024-10-23 21:25:48,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:48,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:48,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:48,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:48,942 INFO L87 Difference]: Start difference. First operand 14150 states and 14431 transitions. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:49,695 INFO L93 Difference]: Finished difference Result 30602 states and 31211 transitions. [2024-10-23 21:25:49,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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 1898 [2024-10-23 21:25:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:49,709 INFO L225 Difference]: With dead ends: 30602 [2024-10-23 21:25:49,710 INFO L226 Difference]: Without dead ends: 17111 [2024-10-23 21:25:49,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:49,719 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 206 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:49,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 41 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:25:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-23 21:25:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 14808. [2024-10-23 21:25:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.0195177956371986) internal successors, (15096), 14807 states have internal predecessors, (15096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15096 transitions. [2024-10-23 21:25:49,843 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15096 transitions. Word has length 1898 [2024-10-23 21:25:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:49,844 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15096 transitions. [2024-10-23 21:25:49,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15096 transitions. [2024-10-23 21:25:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1940 [2024-10-23 21:25:49,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:49,866 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:49,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-23 21:25:49,866 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:49,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash 719055270, now seen corresponding path program 1 times [2024-10-23 21:25:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:49,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829215950] [2024-10-23 21:25:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7413 backedges. 5379 proven. 360 refuted. 0 times theorem prover too weak. 1674 trivial. 0 not checked. [2024-10-23 21:25:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829215950] [2024-10-23 21:25:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829215950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:25:52,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344050727] [2024-10-23 21:25:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:52,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:25:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:25:52,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:25:52,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 21:25:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:53,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 2243 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:25:53,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:25:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7413 backedges. 4172 proven. 0 refuted. 0 times theorem prover too weak. 3241 trivial. 0 not checked. [2024-10-23 21:25:54,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:25:54,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344050727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:54,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:25:54,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-10-23 21:25:54,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981964905] [2024-10-23 21:25:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:54,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:54,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:54,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-23 21:25:54,042 INFO L87 Difference]: Start difference. First operand 14808 states and 15096 transitions. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:54,713 INFO L93 Difference]: Finished difference Result 28957 states and 29529 transitions. [2024-10-23 21:25:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:54,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 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 1939 [2024-10-23 21:25:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:54,728 INFO L225 Difference]: With dead ends: 28957 [2024-10-23 21:25:54,728 INFO L226 Difference]: Without dead ends: 14808 [2024-10-23 21:25:54,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1947 GetRequests, 1941 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-23 21:25:54,738 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 120 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:54,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 418 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:25:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14808 states. [2024-10-23 21:25:54,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14808 to 14808. [2024-10-23 21:25:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14808 states, 14807 states have (on average 1.019315188762072) internal successors, (15093), 14807 states have internal predecessors, (15093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14808 states to 14808 states and 15093 transitions. [2024-10-23 21:25:54,858 INFO L78 Accepts]: Start accepts. Automaton has 14808 states and 15093 transitions. Word has length 1939 [2024-10-23 21:25:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:54,859 INFO L471 AbstractCegarLoop]: Abstraction has 14808 states and 15093 transitions. [2024-10-23 21:25:54,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 14808 states and 15093 transitions. [2024-10-23 21:25:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1964 [2024-10-23 21:25:54,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:54,881 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:54,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 21:25:55,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:25:55,082 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:55,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash -986278543, now seen corresponding path program 1 times [2024-10-23 21:25:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737180163] [2024-10-23 21:25:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 2126 proven. 0 refuted. 0 times theorem prover too weak. 5904 trivial. 0 not checked. [2024-10-23 21:25:55,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:55,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737180163] [2024-10-23 21:25:55,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737180163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:25:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 21:25:55,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 21:25:55,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292414006] [2024-10-23 21:25:55,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:25:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:25:55,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:25:55,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:25:55,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:55,785 INFO L87 Difference]: Start difference. First operand 14808 states and 15093 transitions. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:25:56,467 INFO L93 Difference]: Finished difference Result 31260 states and 31874 transitions. [2024-10-23 21:25:56,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:25:56,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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 1963 [2024-10-23 21:25:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:25:56,489 INFO L225 Difference]: With dead ends: 31260 [2024-10-23 21:25:56,489 INFO L226 Difference]: Without dead ends: 17111 [2024-10-23 21:25:56,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 21:25:56,501 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 138 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:25:56,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 414 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:25:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-23 21:25:56,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 16453. [2024-10-23 21:25:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.0184172137126186) internal successors, (16755), 16452 states have internal predecessors, (16755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:56,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 16755 transitions. [2024-10-23 21:25:56,637 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 16755 transitions. Word has length 1963 [2024-10-23 21:25:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:25:56,637 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 16755 transitions. [2024-10-23 21:25:56,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:25:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 16755 transitions. [2024-10-23 21:25:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2011 [2024-10-23 21:25:56,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:25:56,661 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:25:56,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-23 21:25:56,661 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:25:56,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:25:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1266185862, now seen corresponding path program 1 times [2024-10-23 21:25:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:25:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177901326] [2024-10-23 21:25:56,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:25:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8259 backedges. 5349 proven. 228 refuted. 0 times theorem prover too weak. 2682 trivial. 0 not checked. [2024-10-23 21:25:58,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:25:58,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177901326] [2024-10-23 21:25:58,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177901326] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:25:58,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344907808] [2024-10-23 21:25:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:25:58,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:25:58,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:25:58,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:25:58,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 21:25:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:25:59,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 2307 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:25:59,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:26:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8259 backedges. 5387 proven. 0 refuted. 0 times theorem prover too weak. 2872 trivial. 0 not checked. [2024-10-23 21:26:00,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:26:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344907808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:26:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-23 21:26:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811029567] [2024-10-23 21:26:00,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:00,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:00,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:00,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:00,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:26:00,224 INFO L87 Difference]: Start difference. First operand 16453 states and 16755 transitions. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:26:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:00,863 INFO L93 Difference]: Finished difference Result 32247 states and 32847 transitions. [2024-10-23 21:26:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 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 2010 [2024-10-23 21:26:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:00,879 INFO L225 Difference]: With dead ends: 32247 [2024-10-23 21:26:00,879 INFO L226 Difference]: Without dead ends: 16453 [2024-10-23 21:26:00,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2017 GetRequests, 2012 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:26:00,888 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 62 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:00,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 421 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 21:26:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2024-10-23 21:26:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 16453. [2024-10-23 21:26:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.0181740821784586) internal successors, (16751), 16452 states have internal predecessors, (16751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:26:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 16751 transitions. [2024-10-23 21:26:01,008 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 16751 transitions. Word has length 2010 [2024-10-23 21:26:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:01,009 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 16751 transitions. [2024-10-23 21:26:01,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:26:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 16751 transitions. [2024-10-23 21:26:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2243 [2024-10-23 21:26:01,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 21:26:01,036 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 21:26:01,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-23 21:26:01,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:26:01,237 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 21:26:01,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 21:26:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1328217708, now seen corresponding path program 1 times [2024-10-23 21:26:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 21:26:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567159447] [2024-10-23 21:26:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 21:26:01,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10494 backedges. 7294 proven. 140 refuted. 0 times theorem prover too weak. 3060 trivial. 0 not checked. [2024-10-23 21:26:03,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 21:26:03,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567159447] [2024-10-23 21:26:03,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567159447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 21:26:03,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606513618] [2024-10-23 21:26:03,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 21:26:03,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 21:26:03,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 21:26:03,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 21:26:03,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-23 21:26:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 21:26:04,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 2581 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 21:26:04,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 21:26:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10494 backedges. 5832 proven. 0 refuted. 0 times theorem prover too weak. 4662 trivial. 0 not checked. [2024-10-23 21:26:04,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 21:26:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606513618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 21:26:04,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 21:26:04,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-23 21:26:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818866034] [2024-10-23 21:26:04,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 21:26:04,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 21:26:04,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 21:26:04,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 21:26:04,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:26:04,398 INFO L87 Difference]: Start difference. First operand 16453 states and 16751 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:26:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 21:26:05,131 INFO L93 Difference]: Finished difference Result 34219 states and 34844 transitions. [2024-10-23 21:26:05,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 21:26:05,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 2242 [2024-10-23 21:26:05,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 21:26:05,132 INFO L225 Difference]: With dead ends: 34219 [2024-10-23 21:26:05,132 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 21:26:05,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2247 GetRequests, 2242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-23 21:26:05,143 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 221 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 21:26:05,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 416 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 21:26:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 21:26:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 21:26:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:26:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 21:26:05,145 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2242 [2024-10-23 21:26:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 21:26:05,145 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 21:26:05,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 21:26:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 21:26:05,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 21:26:05,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 21:26:05,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-23 21:26:05,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-23 21:26:05,356 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-23 21:26:05,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 21:26:06,863 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 21:26:06,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 09:26:06 BoogieIcfgContainer [2024-10-23 21:26:06,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 21:26:06,884 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 21:26:06,884 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 21:26:06,884 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 21:26:06,884 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 09:25:03" (3/4) ... [2024-10-23 21:26:06,888 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 21:26:06,928 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-23 21:26:06,931 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 21:26:06,933 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 21:26:06,934 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 21:26:07,140 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 21:26:07,142 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 21:26:07,142 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 21:26:07,143 INFO L158 Benchmark]: Toolchain (without parser) took 66892.60ms. Allocated memory was 163.6MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 107.7MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. [2024-10-23 21:26:07,143 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 21:26:07,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 997.91ms. Allocated memory is still 163.6MB. Free memory was 107.1MB in the beginning and 90.0MB in the end (delta: 17.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-23 21:26:07,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.21ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 65.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-23 21:26:07,145 INFO L158 Benchmark]: Boogie Preprocessor took 295.68ms. Allocated memory is still 163.6MB. Free memory was 65.7MB in the beginning and 92.6MB in the end (delta: -26.9MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-10-23 21:26:07,145 INFO L158 Benchmark]: RCFGBuilder took 2269.58ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 92.5MB in the beginning and 174.5MB in the end (delta: -82.1MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-10-23 21:26:07,146 INFO L158 Benchmark]: TraceAbstraction took 62917.77ms. Allocated memory was 234.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 174.5MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-10-23 21:26:07,146 INFO L158 Benchmark]: Witness Printer took 258.42ms. Allocated memory is still 2.5GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-23 21:26:07,147 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 58.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 997.91ms. Allocated memory is still 163.6MB. Free memory was 107.1MB in the beginning and 90.0MB in the end (delta: 17.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.21ms. Allocated memory is still 163.6MB. Free memory was 90.0MB in the beginning and 65.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 295.68ms. Allocated memory is still 163.6MB. Free memory was 65.7MB in the beginning and 92.6MB in the end (delta: -26.9MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2269.58ms. Allocated memory was 163.6MB in the beginning and 234.9MB in the end (delta: 71.3MB). Free memory was 92.5MB in the beginning and 174.5MB in the end (delta: -82.1MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. * TraceAbstraction took 62917.77ms. Allocated memory was 234.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 174.5MB in the beginning and 2.3GB in the end (delta: -2.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 258.42ms. Allocated memory is still 2.5GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 185]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.3s, OverallIterations: 26, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 24.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4711 SdHoareTripleChecker+Valid, 22.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4711 mSDsluCounter, 8020 SdHoareTripleChecker+Invalid, 18.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 222 mSDsCounter, 2594 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23134 IncrementalHoareTripleChecker+Invalid, 25728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2594 mSolverCounterUnsat, 7798 mSDtfsCounter, 23134 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8629 GetRequests, 8574 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16782occurred in iteration=18, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 8883 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 26.5s InterpolantComputationTime, 35592 NumberOfCodeBlocks, 35592 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 35561 ConstructedInterpolants, 0 QuantifiedInterpolants, 70511 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9804 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 31 InterpolantComputations, 26 PerfectInterpolantSequences, 111104/112020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((a16 == 9) && (7 == a12)) || (((a16 == 10) && (a12 == 8)) && (a15 == 3))) || ((((a15 <= 3) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a16 <= 11))) || (((a15 <= 3) && (a18 <= 132)) && (7 == a12))) || ((a12 <= 5) && (a16 == 8))) || ((a12 == 9) && (a16 == 9))) || ((((a12 <= 5) && (a15 != 3)) && (a18 <= 132)) && (a16 <= 11))) || ((((a12 <= 5) && (158 <= a18)) && (a15 != 3)) && (a16 <= 11))) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || ((a12 == 6) && (a16 <= 11))) || (((a16 == 8) && (a15 <= 3)) && (((long long) 87 + a18) <= 0))) || (((((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (a12 == 8)) && (a15 != 3)) && (a18 <= 132))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || (((0 <= ((long long) 87 + a18)) && (a12 == 9)) && (a15 <= 3))) || (((a16 == 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || ((((a15 <= 3) && (a12 == 8)) && (a18 <= 132)) && (11 <= a16))) || (((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (7 == a12))) || ((((a15 <= 3) && (a12 == 8)) && (158 <= a18)) && (11 <= a16))) || (((5 == a12) && (a15 == 3)) && (11 <= a16))) || (((a16 == 9) && (a15 <= 3)) && (a12 == 8))) || ((a12 == 9) && (a16 == 8))) || (((a16 == 8) && (a15 <= 3)) && (158 <= a18))) || (((a16 == 9) && (5 == a12)) && (a15 == 3))) || ((((a16 == 9) && (a15 != 3)) && (a18 <= 132)) && (a12 <= 8))) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 6))) || (((a12 == 9) && (a15 <= 3)) && (((long long) a18 + 156) <= 0))) || (((a16 == 8) && (((long long) a18 + 156) <= 0)) && (7 == a12))) || ((((0 <= ((long long) 87 + a18)) && (a18 <= 132)) && (5 == a12)) && (a15 == 3))) RESULT: Ultimate proved your program to be correct! [2024-10-23 21:26:07,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE