./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/Problem11_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label10.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 68bba3302e6a94fc1a2bd97d9ea3c006d28b9ba843bd296b9f627a896167b8ce --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:26:59,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:26:59,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:26:59,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:26:59,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:26:59,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:26:59,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:26:59,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:26:59,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:26:59,435 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:26:59,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:26:59,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:26:59,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:26:59,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:26:59,438 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:26:59,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:26:59,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:26:59,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:26:59,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:26:59,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:26:59,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:26:59,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:26:59,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:26:59,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:26:59,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:26:59,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:26:59,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:26:59,443 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:26:59,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:26:59,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:26:59,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:26:59,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:26:59,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:26:59,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:26:59,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:26:59,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:26:59,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:26:59,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:26:59,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:26:59,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:26:59,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:26:59,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:26:59,447 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 -> 68bba3302e6a94fc1a2bd97d9ea3c006d28b9ba843bd296b9f627a896167b8ce [2024-10-13 23:26:59,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:26:59,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:26:59,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:26:59,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:26:59,662 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:26:59,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label10.c [2024-10-13 23:27:00,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:27:01,136 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:27:01,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label10.c [2024-10-13 23:27:01,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbf25c80/c5ab27a287f04c54aa39d00f25f9ffe9/FLAGa893992a3 [2024-10-13 23:27:01,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbf25c80/c5ab27a287f04c54aa39d00f25f9ffe9 [2024-10-13 23:27:01,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:27:01,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:27:01,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:27:01,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:27:01,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:27:01,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c78f77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01, skipping insertion in model container [2024-10-13 23:27:01,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:27:01,367 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/Problem11_label10.c[3268,3281] [2024-10-13 23:27:01,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:27:01,550 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:27:01,566 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/Problem11_label10.c[3268,3281] [2024-10-13 23:27:01,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:27:01,702 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:27:01,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01 WrapperNode [2024-10-13 23:27:01,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:27:01,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:27:01,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:27:01,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:27:01,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,811 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-13 23:27:01,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:27:01,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:27:01,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:27:01,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:27:01,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,871 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:27:01,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:27:01,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:27:01,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:27:01,952 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:27:01,953 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (1/1) ... [2024-10-13 23:27:01,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:27:01,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:27:01,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:27:01,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:27:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:27:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:27:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:27:02,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:27:02,065 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:27:02,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:27:03,212 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-13 23:27:03,213 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:27:03,255 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:27:03,256 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:27:03,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:27:03 BoogieIcfgContainer [2024-10-13 23:27:03,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:27:03,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:27:03,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:27:03,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:27:03,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:27:01" (1/3) ... [2024-10-13 23:27:03,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c29eb4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:27:03, skipping insertion in model container [2024-10-13 23:27:03,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:27:01" (2/3) ... [2024-10-13 23:27:03,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c29eb4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:27:03, skipping insertion in model container [2024-10-13 23:27:03,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:27:03" (3/3) ... [2024-10-13 23:27:03,264 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label10.c [2024-10-13 23:27:03,275 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:27:03,275 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:27:03,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:27:03,345 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;@3003d988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:27:03,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:27:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 23:27:03,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:03,356 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] [2024-10-13 23:27:03,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:03,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1103199144, now seen corresponding path program 1 times [2024-10-13 23:27:03,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979244194] [2024-10-13 23:27:03,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:03,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979244194] [2024-10-13 23:27:03,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979244194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:03,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:03,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:27:03,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837404853] [2024-10-13 23:27:03,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:03,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:27:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:03,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:27:03,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:27:03,564 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 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 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:03,608 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-13 23:27:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:27:03,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-13 23:27:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:03,620 INFO L225 Difference]: With dead ends: 441 [2024-10-13 23:27:03,620 INFO L226 Difference]: Without dead ends: 219 [2024-10-13 23:27:03,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:27:03,626 INFO L432 NwaCegarLoop]: 355 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, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:03,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:27:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-13 23:27:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-13 23:27:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-13 23:27:03,672 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 21 [2024-10-13 23:27:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:03,672 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-13 23:27:03,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-13 23:27:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 23:27:03,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:03,673 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] [2024-10-13 23:27:03,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:27:03,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:03,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1190941133, now seen corresponding path program 1 times [2024-10-13 23:27:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:03,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139828848] [2024-10-13 23:27:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139828848] [2024-10-13 23:27:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139828848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:27:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645605318] [2024-10-13 23:27:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:03,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:03,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:03,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:03,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:03,781 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:04,512 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2024-10-13 23:27:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2024-10-13 23:27:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:04,514 INFO L225 Difference]: With dead ends: 630 [2024-10-13 23:27:04,514 INFO L226 Difference]: Without dead ends: 412 [2024-10-13 23:27:04,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:04,516 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 186 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:04,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 144 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:27:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-13 23:27:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-10-13 23:27:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2024-10-13 23:27:04,538 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 21 [2024-10-13 23:27:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:04,538 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2024-10-13 23:27:04,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2024-10-13 23:27:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 23:27:04,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:04,543 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:04,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:27:04,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:04,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:04,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1951995941, now seen corresponding path program 1 times [2024-10-13 23:27:04,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:04,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950158067] [2024-10-13 23:27:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950158067] [2024-10-13 23:27:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950158067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:27:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368498191] [2024-10-13 23:27:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:04,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:04,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:04,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:04,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:04,717 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:05,345 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2024-10-13 23:27:05,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:05,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-13 23:27:05,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:05,349 INFO L225 Difference]: With dead ends: 1208 [2024-10-13 23:27:05,349 INFO L226 Difference]: Without dead ends: 799 [2024-10-13 23:27:05,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:05,351 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:05,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:27:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-13 23:27:05,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2024-10-13 23:27:05,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3859872611464967) internal successors, (1088), 785 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1088 transitions. [2024-10-13 23:27:05,382 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1088 transitions. Word has length 89 [2024-10-13 23:27:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:05,382 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1088 transitions. [2024-10-13 23:27:05,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1088 transitions. [2024-10-13 23:27:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-13 23:27:05,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:05,383 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-13 23:27:05,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:27:05,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:05,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:05,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1234958399, now seen corresponding path program 1 times [2024-10-13 23:27:05,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:05,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282479783] [2024-10-13 23:27:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:05,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:05,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282479783] [2024-10-13 23:27:05,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282479783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:05,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:05,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:27:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408424838] [2024-10-13 23:27:05,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:05,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:05,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:05,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:05,599 INFO L87 Difference]: Start difference. First operand 786 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:06,166 INFO L93 Difference]: Finished difference Result 1941 states and 2630 transitions. [2024-10-13 23:27:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-13 23:27:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:06,171 INFO L225 Difference]: With dead ends: 1941 [2024-10-13 23:27:06,171 INFO L226 Difference]: Without dead ends: 1156 [2024-10-13 23:27:06,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:06,173 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:06,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:27:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-10-13 23:27:06,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1155. [2024-10-13 23:27:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2781629116117852) internal successors, (1475), 1154 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1475 transitions. [2024-10-13 23:27:06,199 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1475 transitions. Word has length 90 [2024-10-13 23:27:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:06,202 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1475 transitions. [2024-10-13 23:27:06,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1475 transitions. [2024-10-13 23:27:06,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-13 23:27:06,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:06,204 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:06,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:27:06,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:06,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:06,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1920086889, now seen corresponding path program 1 times [2024-10-13 23:27:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088799523] [2024-10-13 23:27:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-13 23:27:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088799523] [2024-10-13 23:27:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088799523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:06,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:27:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046613353] [2024-10-13 23:27:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:06,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:06,440 INFO L87 Difference]: Start difference. First operand 1155 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:07,121 INFO L93 Difference]: Finished difference Result 2501 states and 3338 transitions. [2024-10-13 23:27:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:07,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 133 [2024-10-13 23:27:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:07,130 INFO L225 Difference]: With dead ends: 2501 [2024-10-13 23:27:07,130 INFO L226 Difference]: Without dead ends: 1531 [2024-10-13 23:27:07,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:07,135 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:07,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 154 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:27:07,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-10-13 23:27:07,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-10-13 23:27:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 1.2620915032679738) internal successors, (1931), 1530 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1931 transitions. [2024-10-13 23:27:07,165 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1931 transitions. Word has length 133 [2024-10-13 23:27:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:07,166 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1931 transitions. [2024-10-13 23:27:07,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1931 transitions. [2024-10-13 23:27:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 23:27:07,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:07,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:07,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:27:07,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:07,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1963595940, now seen corresponding path program 1 times [2024-10-13 23:27:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139152814] [2024-10-13 23:27:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:07,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139152814] [2024-10-13 23:27:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139152814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:07,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:07,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:07,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256995259] [2024-10-13 23:27:07,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:07,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:07,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:07,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:07,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:07,338 INFO L87 Difference]: Start difference. First operand 1531 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:07,891 INFO L93 Difference]: Finished difference Result 3643 states and 4737 transitions. [2024-10-13 23:27:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:07,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-10-13 23:27:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:07,900 INFO L225 Difference]: With dead ends: 3643 [2024-10-13 23:27:07,900 INFO L226 Difference]: Without dead ends: 2297 [2024-10-13 23:27:07,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:07,904 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 213 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:07,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 319 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:27:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-10-13 23:27:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2294. [2024-10-13 23:27:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 2293 states have (on average 1.2655909289140863) internal successors, (2902), 2293 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 2902 transitions. [2024-10-13 23:27:07,937 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 2902 transitions. Word has length 148 [2024-10-13 23:27:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:07,940 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 2902 transitions. [2024-10-13 23:27:07,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 2902 transitions. [2024-10-13 23:27:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 23:27:07,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:07,943 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:07,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:27:07,943 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:07,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1914825665, now seen corresponding path program 1 times [2024-10-13 23:27:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:07,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887714156] [2024-10-13 23:27:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:07,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:08,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887714156] [2024-10-13 23:27:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887714156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:08,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:08,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669431867] [2024-10-13 23:27:08,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:08,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:08,097 INFO L87 Difference]: Start difference. First operand 2294 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:08,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:08,676 INFO L93 Difference]: Finished difference Result 5527 states and 7094 transitions. [2024-10-13 23:27:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:08,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2024-10-13 23:27:08,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:08,685 INFO L225 Difference]: With dead ends: 5527 [2024-10-13 23:27:08,685 INFO L226 Difference]: Without dead ends: 3418 [2024-10-13 23:27:08,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:08,687 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:08,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 337 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:27:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3418 states. [2024-10-13 23:27:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3418 to 3217. [2024-10-13 23:27:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3217 states, 3216 states have (on average 1.2378731343283582) internal successors, (3981), 3216 states have internal predecessors, (3981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 3981 transitions. [2024-10-13 23:27:08,727 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 3981 transitions. Word has length 201 [2024-10-13 23:27:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:08,727 INFO L471 AbstractCegarLoop]: Abstraction has 3217 states and 3981 transitions. [2024-10-13 23:27:08,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 3981 transitions. [2024-10-13 23:27:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-13 23:27:08,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:08,729 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:08,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:27:08,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:08,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:08,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1907730341, now seen corresponding path program 1 times [2024-10-13 23:27:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804951161] [2024-10-13 23:27:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 23:27:08,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:08,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804951161] [2024-10-13 23:27:08,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804951161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:08,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:08,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331606949] [2024-10-13 23:27:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:08,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:08,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:08,893 INFO L87 Difference]: Start difference. First operand 3217 states and 3981 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:09,445 INFO L93 Difference]: Finished difference Result 7370 states and 9142 transitions. [2024-10-13 23:27:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 202 [2024-10-13 23:27:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:09,454 INFO L225 Difference]: With dead ends: 7370 [2024-10-13 23:27:09,455 INFO L226 Difference]: Without dead ends: 4154 [2024-10-13 23:27:09,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:09,458 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 180 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:09,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 342 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:27:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2024-10-13 23:27:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 4137. [2024-10-13 23:27:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 4136 states have (on average 1.2212282398452612) internal successors, (5051), 4136 states have internal predecessors, (5051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 5051 transitions. [2024-10-13 23:27:09,503 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 5051 transitions. Word has length 202 [2024-10-13 23:27:09,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:09,503 INFO L471 AbstractCegarLoop]: Abstraction has 4137 states and 5051 transitions. [2024-10-13 23:27:09,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 5051 transitions. [2024-10-13 23:27:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-13 23:27:09,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:09,505 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:09,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:27:09,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:09,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:09,507 INFO L85 PathProgramCache]: Analyzing trace with hash 87428444, now seen corresponding path program 1 times [2024-10-13 23:27:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:09,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804698939] [2024-10-13 23:27:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:09,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-13 23:27:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:09,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804698939] [2024-10-13 23:27:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804698939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616271385] [2024-10-13 23:27:09,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:09,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:09,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:09,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:09,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:09,677 INFO L87 Difference]: Start difference. First operand 4137 states and 5051 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:10,273 INFO L93 Difference]: Finished difference Result 9206 states and 11352 transitions. [2024-10-13 23:27:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:10,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2024-10-13 23:27:10,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:10,287 INFO L225 Difference]: With dead ends: 9206 [2024-10-13 23:27:10,311 INFO L226 Difference]: Without dead ends: 5070 [2024-10-13 23:27:10,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:10,317 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 175 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:10,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 376 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:27:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5070 states. [2024-10-13 23:27:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5070 to 4873. [2024-10-13 23:27:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4872 states have (on average 1.208743842364532) internal successors, (5889), 4872 states have internal predecessors, (5889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 5889 transitions. [2024-10-13 23:27:10,386 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 5889 transitions. Word has length 203 [2024-10-13 23:27:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 4873 states and 5889 transitions. [2024-10-13 23:27:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5889 transitions. [2024-10-13 23:27:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 23:27:10,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:10,389 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:10,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:27:10,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:10,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1885450602, now seen corresponding path program 1 times [2024-10-13 23:27:10,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:10,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115944278] [2024-10-13 23:27:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115944278] [2024-10-13 23:27:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115944278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:10,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:10,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:27:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298750988] [2024-10-13 23:27:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:10,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:27:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:27:10,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:27:10,697 INFO L87 Difference]: Start difference. First operand 4873 states and 5889 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:11,692 INFO L93 Difference]: Finished difference Result 15869 states and 19334 transitions. [2024-10-13 23:27:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:27:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2024-10-13 23:27:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:11,716 INFO L225 Difference]: With dead ends: 15869 [2024-10-13 23:27:11,716 INFO L226 Difference]: Without dead ends: 10997 [2024-10-13 23:27:11,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:27:11,722 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 312 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:11,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 190 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:27:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10997 states. [2024-10-13 23:27:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10997 to 8952. [2024-10-13 23:27:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8952 states, 8951 states have (on average 1.190816668528656) internal successors, (10659), 8951 states have internal predecessors, (10659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 10659 transitions. [2024-10-13 23:27:11,828 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 10659 transitions. Word has length 223 [2024-10-13 23:27:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:11,829 INFO L471 AbstractCegarLoop]: Abstraction has 8952 states and 10659 transitions. [2024-10-13 23:27:11,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 10659 transitions. [2024-10-13 23:27:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 23:27:11,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:11,832 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:11,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:27:11,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:11,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:11,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1372216911, now seen corresponding path program 1 times [2024-10-13 23:27:11,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457466346] [2024-10-13 23:27:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:11,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:12,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:12,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457466346] [2024-10-13 23:27:12,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457466346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:12,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:27:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911471487] [2024-10-13 23:27:12,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:12,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:27:12,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:12,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:27:12,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:27:12,101 INFO L87 Difference]: Start difference. First operand 8952 states and 10659 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:13,142 INFO L93 Difference]: Finished difference Result 22714 states and 27383 transitions. [2024-10-13 23:27:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:27:13,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2024-10-13 23:27:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:13,168 INFO L225 Difference]: With dead ends: 22714 [2024-10-13 23:27:13,168 INFO L226 Difference]: Without dead ends: 13763 [2024-10-13 23:27:13,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:27:13,178 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 324 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:13,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 119 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:27:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13763 states. [2024-10-13 23:27:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13763 to 13377. [2024-10-13 23:27:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13377 states, 13376 states have (on average 1.192209928229665) internal successors, (15947), 13376 states have internal predecessors, (15947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13377 states to 13377 states and 15947 transitions. [2024-10-13 23:27:13,344 INFO L78 Accepts]: Start accepts. Automaton has 13377 states and 15947 transitions. Word has length 233 [2024-10-13 23:27:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:13,344 INFO L471 AbstractCegarLoop]: Abstraction has 13377 states and 15947 transitions. [2024-10-13 23:27:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 13377 states and 15947 transitions. [2024-10-13 23:27:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-13 23:27:13,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:13,348 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:13,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:27:13,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1107744293, now seen corresponding path program 1 times [2024-10-13 23:27:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621039635] [2024-10-13 23:27:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 101 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:13,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621039635] [2024-10-13 23:27:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621039635] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:27:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293308577] [2024-10-13 23:27:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:13,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:27:13,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:27:13,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:27:13,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:27:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:13,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 23:27:13,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:27:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 74 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:14,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:27:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 74 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293308577] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 23:27:15,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 23:27:15,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-13 23:27:15,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366499994] [2024-10-13 23:27:15,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 23:27:15,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 23:27:15,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 23:27:15,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 23:27:15,687 INFO L87 Difference]: Start difference. First operand 13377 states and 15947 transitions. Second operand has 11 states, 11 states have (on average 34.27272727272727) internal successors, (377), 10 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:18,351 INFO L93 Difference]: Finished difference Result 28501 states and 34239 transitions. [2024-10-13 23:27:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 23:27:18,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 34.27272727272727) internal successors, (377), 10 states have internal predecessors, (377), 0 states have call successors, (0), 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 235 [2024-10-13 23:27:18,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:18,370 INFO L225 Difference]: With dead ends: 28501 [2024-10-13 23:27:18,370 INFO L226 Difference]: Without dead ends: 15113 [2024-10-13 23:27:18,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2024-10-13 23:27:18,380 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 2063 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4645 mSolverCounterSat, 805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 4645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:18,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 152 Invalid, 5450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 4645 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:27:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15113 states. [2024-10-13 23:27:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15113 to 13529. [2024-10-13 23:27:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13529 states, 13528 states have (on average 1.1665434654050857) internal successors, (15781), 13528 states have internal predecessors, (15781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13529 states to 13529 states and 15781 transitions. [2024-10-13 23:27:18,505 INFO L78 Accepts]: Start accepts. Automaton has 13529 states and 15781 transitions. Word has length 235 [2024-10-13 23:27:18,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:18,506 INFO L471 AbstractCegarLoop]: Abstraction has 13529 states and 15781 transitions. [2024-10-13 23:27:18,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.27272727272727) internal successors, (377), 10 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13529 states and 15781 transitions. [2024-10-13 23:27:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-13 23:27:18,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:18,509 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:18,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:27:18,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 23:27:18,714 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:18,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:18,714 INFO L85 PathProgramCache]: Analyzing trace with hash -606487297, now seen corresponding path program 1 times [2024-10-13 23:27:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271860742] [2024-10-13 23:27:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:18,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 95 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:19,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:19,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271860742] [2024-10-13 23:27:19,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271860742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:27:19,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381267306] [2024-10-13 23:27:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:19,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:27:19,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:27:19,200 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:27:19,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:27:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:19,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:27:19,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:27:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:19,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:27:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381267306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:27:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:27:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108210106] [2024-10-13 23:27:19,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:19,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:27:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:27:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:27:19,623 INFO L87 Difference]: Start difference. First operand 13529 states and 15781 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:20,303 INFO L93 Difference]: Finished difference Result 27245 states and 31761 transitions. [2024-10-13 23:27:20,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:27:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2024-10-13 23:27:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:20,321 INFO L225 Difference]: With dead ends: 27245 [2024-10-13 23:27:20,321 INFO L226 Difference]: Without dead ends: 13717 [2024-10-13 23:27:20,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:27:20,332 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 186 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:20,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 145 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:27:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13717 states. [2024-10-13 23:27:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13717 to 13529. [2024-10-13 23:27:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13529 states, 13528 states have (on average 1.1652128917800118) internal successors, (15763), 13528 states have internal predecessors, (15763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13529 states to 13529 states and 15763 transitions. [2024-10-13 23:27:20,496 INFO L78 Accepts]: Start accepts. Automaton has 13529 states and 15763 transitions. Word has length 254 [2024-10-13 23:27:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:20,497 INFO L471 AbstractCegarLoop]: Abstraction has 13529 states and 15763 transitions. [2024-10-13 23:27:20,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 13529 states and 15763 transitions. [2024-10-13 23:27:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-13 23:27:20,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:20,501 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-13 23:27:20,515 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-13 23:27:20,701 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,SelfDestructingSolverStorable12 [2024-10-13 23:27:20,702 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:20,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:20,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2012976343, now seen corresponding path program 1 times [2024-10-13 23:27:20,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:20,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021503368] [2024-10-13 23:27:20,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:20,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-13 23:27:20,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:20,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021503368] [2024-10-13 23:27:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021503368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:20,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:20,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:20,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360046012] [2024-10-13 23:27:20,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:20,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:20,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:20,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:20,804 INFO L87 Difference]: Start difference. First operand 13529 states and 15763 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:21,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:21,292 INFO L93 Difference]: Finished difference Result 25731 states and 30044 transitions. [2024-10-13 23:27:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:21,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 270 [2024-10-13 23:27:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:21,304 INFO L225 Difference]: With dead ends: 25731 [2024-10-13 23:27:21,304 INFO L226 Difference]: Without dead ends: 12203 [2024-10-13 23:27:21,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:21,313 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 167 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:21,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 130 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:27:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12203 states. [2024-10-13 23:27:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12203 to 10912. [2024-10-13 23:27:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10912 states, 10911 states have (on average 1.119879021171295) internal successors, (12219), 10911 states have internal predecessors, (12219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10912 states to 10912 states and 12219 transitions. [2024-10-13 23:27:21,464 INFO L78 Accepts]: Start accepts. Automaton has 10912 states and 12219 transitions. Word has length 270 [2024-10-13 23:27:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:21,464 INFO L471 AbstractCegarLoop]: Abstraction has 10912 states and 12219 transitions. [2024-10-13 23:27:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 10912 states and 12219 transitions. [2024-10-13 23:27:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-13 23:27:21,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:21,471 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:21,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:27:21,471 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:21,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:21,472 INFO L85 PathProgramCache]: Analyzing trace with hash 835990182, now seen corresponding path program 1 times [2024-10-13 23:27:21,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:21,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685542872] [2024-10-13 23:27:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 216 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:27:21,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:21,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685542872] [2024-10-13 23:27:21,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685542872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:27:21,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074301234] [2024-10-13 23:27:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:21,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:27:21,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:27:21,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:27:21,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:27:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:21,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:27:21,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:27:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-13 23:27:22,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:27:22,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074301234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:22,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:27:22,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-13 23:27:22,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775707940] [2024-10-13 23:27:22,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:22,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:22,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:22,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:22,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:27:22,162 INFO L87 Difference]: Start difference. First operand 10912 states and 12219 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:22,561 INFO L93 Difference]: Finished difference Result 22195 states and 24829 transitions. [2024-10-13 23:27:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:22,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 292 [2024-10-13 23:27:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:22,571 INFO L225 Difference]: With dead ends: 22195 [2024-10-13 23:27:22,571 INFO L226 Difference]: Without dead ends: 11100 [2024-10-13 23:27:22,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:27:22,576 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 98 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:22,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 358 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:27:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11100 states. [2024-10-13 23:27:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11100 to 10728. [2024-10-13 23:27:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10728 states, 10727 states have (on average 1.1189521767502564) internal successors, (12003), 10727 states have internal predecessors, (12003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10728 states to 10728 states and 12003 transitions. [2024-10-13 23:27:22,653 INFO L78 Accepts]: Start accepts. Automaton has 10728 states and 12003 transitions. Word has length 292 [2024-10-13 23:27:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:22,654 INFO L471 AbstractCegarLoop]: Abstraction has 10728 states and 12003 transitions. [2024-10-13 23:27:22,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 10728 states and 12003 transitions. [2024-10-13 23:27:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-10-13 23:27:22,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:22,659 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:22,674 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-13 23:27:22,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:27:22,860 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:22,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1925932158, now seen corresponding path program 1 times [2024-10-13 23:27:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:22,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637079730] [2024-10-13 23:27:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:22,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 23:27:23,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637079730] [2024-10-13 23:27:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637079730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:27:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803490870] [2024-10-13 23:27:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:23,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:27:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:23,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:27:23,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:27:23,106 INFO L87 Difference]: Start difference. First operand 10728 states and 12003 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:23,986 INFO L93 Difference]: Finished difference Result 26253 states and 29360 transitions. [2024-10-13 23:27:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:27:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 308 [2024-10-13 23:27:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:24,000 INFO L225 Difference]: With dead ends: 26253 [2024-10-13 23:27:24,000 INFO L226 Difference]: Without dead ends: 15342 [2024-10-13 23:27:24,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:27:24,008 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 340 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:24,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 67 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:27:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15342 states. [2024-10-13 23:27:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15342 to 14230. [2024-10-13 23:27:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14230 states, 14229 states have (on average 1.1139222714175276) internal successors, (15850), 14229 states have internal predecessors, (15850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14230 states to 14230 states and 15850 transitions. [2024-10-13 23:27:24,203 INFO L78 Accepts]: Start accepts. Automaton has 14230 states and 15850 transitions. Word has length 308 [2024-10-13 23:27:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:24,203 INFO L471 AbstractCegarLoop]: Abstraction has 14230 states and 15850 transitions. [2024-10-13 23:27:24,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 14230 states and 15850 transitions. [2024-10-13 23:27:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-10-13 23:27:24,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:24,210 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:24,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:27:24,210 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:24,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash -424114850, now seen corresponding path program 1 times [2024-10-13 23:27:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:24,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328748761] [2024-10-13 23:27:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:24,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-13 23:27:24,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:24,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328748761] [2024-10-13 23:27:24,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328748761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:24,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:24,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:24,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828896150] [2024-10-13 23:27:24,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:24,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:24,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:24,493 INFO L87 Difference]: Start difference. First operand 14230 states and 15850 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:24,997 INFO L93 Difference]: Finished difference Result 30492 states and 33969 transitions. [2024-10-13 23:27:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:24,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 319 [2024-10-13 23:27:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:25,011 INFO L225 Difference]: With dead ends: 30492 [2024-10-13 23:27:25,012 INFO L226 Difference]: Without dead ends: 16263 [2024-10-13 23:27:25,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:25,021 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 194 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:25,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 117 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:27:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16263 states. [2024-10-13 23:27:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16263 to 14042. [2024-10-13 23:27:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14042 states, 14041 states have (on average 1.1135246777295065) internal successors, (15635), 14041 states have internal predecessors, (15635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14042 states to 14042 states and 15635 transitions. [2024-10-13 23:27:25,140 INFO L78 Accepts]: Start accepts. Automaton has 14042 states and 15635 transitions. Word has length 319 [2024-10-13 23:27:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:25,140 INFO L471 AbstractCegarLoop]: Abstraction has 14042 states and 15635 transitions. [2024-10-13 23:27:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states and 15635 transitions. [2024-10-13 23:27:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-10-13 23:27:25,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:25,146 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:27:25,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:27:25,146 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:25,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1393816768, now seen corresponding path program 1 times [2024-10-13 23:27:25,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272881125] [2024-10-13 23:27:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-10-13 23:27:25,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272881125] [2024-10-13 23:27:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272881125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:25,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351130082] [2024-10-13 23:27:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:25,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:25,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:25,343 INFO L87 Difference]: Start difference. First operand 14042 states and 15635 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:25,821 INFO L93 Difference]: Finished difference Result 29187 states and 32491 transitions. [2024-10-13 23:27:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 326 [2024-10-13 23:27:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:25,834 INFO L225 Difference]: With dead ends: 29187 [2024-10-13 23:27:25,834 INFO L226 Difference]: Without dead ends: 15146 [2024-10-13 23:27:25,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:25,842 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 189 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:25,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 108 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:27:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15146 states. [2024-10-13 23:27:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15146 to 13116. [2024-10-13 23:27:25,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13116 states, 13115 states have (on average 1.1124666412504765) internal successors, (14590), 13115 states have internal predecessors, (14590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13116 states to 13116 states and 14590 transitions. [2024-10-13 23:27:25,950 INFO L78 Accepts]: Start accepts. Automaton has 13116 states and 14590 transitions. Word has length 326 [2024-10-13 23:27:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:25,950 INFO L471 AbstractCegarLoop]: Abstraction has 13116 states and 14590 transitions. [2024-10-13 23:27:25,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 13116 states and 14590 transitions. [2024-10-13 23:27:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-10-13 23:27:25,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:25,956 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:27:25,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:27:25,956 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:25,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash -730902534, now seen corresponding path program 1 times [2024-10-13 23:27:25,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:25,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431825752] [2024-10-13 23:27:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:25,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-13 23:27:26,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:26,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431825752] [2024-10-13 23:27:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431825752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613086551] [2024-10-13 23:27:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:27:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:26,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:27:26,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:27:26,151 INFO L87 Difference]: Start difference. First operand 13116 states and 14590 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:26,898 INFO L93 Difference]: Finished difference Result 34707 states and 38541 transitions. [2024-10-13 23:27:26,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:27:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 348 [2024-10-13 23:27:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:26,918 INFO L225 Difference]: With dead ends: 34707 [2024-10-13 23:27:26,918 INFO L226 Difference]: Without dead ends: 21224 [2024-10-13 23:27:26,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:27:26,929 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 199 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:26,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 54 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:27:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21224 states. [2024-10-13 23:27:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21224 to 21036. [2024-10-13 23:27:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21036 states, 21035 states have (on average 1.1072498217256952) internal successors, (23291), 21035 states have internal predecessors, (23291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 23291 transitions. [2024-10-13 23:27:27,092 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 23291 transitions. Word has length 348 [2024-10-13 23:27:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:27,092 INFO L471 AbstractCegarLoop]: Abstraction has 21036 states and 23291 transitions. [2024-10-13 23:27:27,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 23291 transitions. [2024-10-13 23:27:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-10-13 23:27:27,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:27,102 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:27,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:27:27,102 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:27,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:27,102 INFO L85 PathProgramCache]: Analyzing trace with hash 426084589, now seen corresponding path program 1 times [2024-10-13 23:27:27,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:27,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655465523] [2024-10-13 23:27:27,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:27,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-13 23:27:27,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:27,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655465523] [2024-10-13 23:27:27,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655465523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:27,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:27,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700031786] [2024-10-13 23:27:27,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:27,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:27,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:27,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:27,310 INFO L87 Difference]: Start difference. First operand 21036 states and 23291 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:27,818 INFO L93 Difference]: Finished difference Result 42252 states and 46776 transitions. [2024-10-13 23:27:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:27,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 384 [2024-10-13 23:27:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:27,840 INFO L225 Difference]: With dead ends: 42252 [2024-10-13 23:27:27,840 INFO L226 Difference]: Without dead ends: 24163 [2024-10-13 23:27:27,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:27,852 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 196 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:27,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 126 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:27:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24163 states. [2024-10-13 23:27:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24163 to 15695. [2024-10-13 23:27:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15695 states, 15694 states have (on average 1.1086402446794954) internal successors, (17399), 15694 states have internal predecessors, (17399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15695 states to 15695 states and 17399 transitions. [2024-10-13 23:27:27,999 INFO L78 Accepts]: Start accepts. Automaton has 15695 states and 17399 transitions. Word has length 384 [2024-10-13 23:27:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:28,000 INFO L471 AbstractCegarLoop]: Abstraction has 15695 states and 17399 transitions. [2024-10-13 23:27:28,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 15695 states and 17399 transitions. [2024-10-13 23:27:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2024-10-13 23:27:28,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:28,008 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:28,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:27:28,008 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:28,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1269958743, now seen corresponding path program 1 times [2024-10-13 23:27:28,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:28,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122623558] [2024-10-13 23:27:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:28,471 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2024-10-13 23:27:28,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:28,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122623558] [2024-10-13 23:27:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122623558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:28,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:28,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970192718] [2024-10-13 23:27:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:28,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:28,474 INFO L87 Difference]: Start difference. First operand 15695 states and 17399 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:29,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:29,012 INFO L93 Difference]: Finished difference Result 30852 states and 34230 transitions. [2024-10-13 23:27:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:29,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 437 [2024-10-13 23:27:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:29,028 INFO L225 Difference]: With dead ends: 30852 [2024-10-13 23:27:29,028 INFO L226 Difference]: Without dead ends: 15526 [2024-10-13 23:27:29,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:29,038 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 111 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:29,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 144 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:27:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15526 states. [2024-10-13 23:27:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15526 to 14407. [2024-10-13 23:27:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14407 states, 14406 states have (on average 1.1028738025822573) internal successors, (15888), 14406 states have internal predecessors, (15888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14407 states to 14407 states and 15888 transitions. [2024-10-13 23:27:29,209 INFO L78 Accepts]: Start accepts. Automaton has 14407 states and 15888 transitions. Word has length 437 [2024-10-13 23:27:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:29,209 INFO L471 AbstractCegarLoop]: Abstraction has 14407 states and 15888 transitions. [2024-10-13 23:27:29,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14407 states and 15888 transitions. [2024-10-13 23:27:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-10-13 23:27:29,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:29,218 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:29,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 23:27:29,219 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:29,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1761152921, now seen corresponding path program 1 times [2024-10-13 23:27:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060350543] [2024-10-13 23:27:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 23:27:29,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:29,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060350543] [2024-10-13 23:27:29,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060350543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:29,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:29,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 23:27:29,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077302995] [2024-10-13 23:27:29,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:29,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 23:27:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 23:27:29,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:27:29,834 INFO L87 Difference]: Start difference. First operand 14407 states and 15888 transitions. Second operand has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:30,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:30,986 INFO L93 Difference]: Finished difference Result 34172 states and 37670 transitions. [2024-10-13 23:27:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 23:27:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 486 [2024-10-13 23:27:30,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:31,003 INFO L225 Difference]: With dead ends: 34172 [2024-10-13 23:27:31,003 INFO L226 Difference]: Without dead ends: 19950 [2024-10-13 23:27:31,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:27:31,011 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 377 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:31,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 99 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:27:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2024-10-13 23:27:31,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 16062. [2024-10-13 23:27:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16062 states, 16061 states have (on average 1.09887304651018) internal successors, (17649), 16061 states have internal predecessors, (17649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:31,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 17649 transitions. [2024-10-13 23:27:31,148 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 17649 transitions. Word has length 486 [2024-10-13 23:27:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:31,149 INFO L471 AbstractCegarLoop]: Abstraction has 16062 states and 17649 transitions. [2024-10-13 23:27:31,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.4) internal successors, (397), 5 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 17649 transitions. [2024-10-13 23:27:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2024-10-13 23:27:31,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:31,159 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:31,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 23:27:31,159 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:31,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash -333210499, now seen corresponding path program 1 times [2024-10-13 23:27:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:31,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286610112] [2024-10-13 23:27:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-13 23:27:31,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:31,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286610112] [2024-10-13 23:27:31,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286610112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:31,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:31,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 23:27:31,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300486170] [2024-10-13 23:27:31,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:31,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 23:27:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:31,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 23:27:31,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:27:31,572 INFO L87 Difference]: Start difference. First operand 16062 states and 17649 transitions. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:32,551 INFO L93 Difference]: Finished difference Result 33421 states and 36704 transitions. [2024-10-13 23:27:32,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 23:27:32,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 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 490 [2024-10-13 23:27:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:32,566 INFO L225 Difference]: With dead ends: 33421 [2024-10-13 23:27:32,566 INFO L226 Difference]: Without dead ends: 17544 [2024-10-13 23:27:32,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:27:32,575 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 384 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:32,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 62 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:27:32,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17544 states. [2024-10-13 23:27:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17544 to 11453. [2024-10-13 23:27:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11453 states, 11452 states have (on average 1.0977121900104785) internal successors, (12571), 11452 states have internal predecessors, (12571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11453 states to 11453 states and 12571 transitions. [2024-10-13 23:27:32,688 INFO L78 Accepts]: Start accepts. Automaton has 11453 states and 12571 transitions. Word has length 490 [2024-10-13 23:27:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:32,689 INFO L471 AbstractCegarLoop]: Abstraction has 11453 states and 12571 transitions. [2024-10-13 23:27:32,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 11453 states and 12571 transitions. [2024-10-13 23:27:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2024-10-13 23:27:32,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:32,697 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:32,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 23:27:32,697 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:32,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1888315402, now seen corresponding path program 1 times [2024-10-13 23:27:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203949594] [2024-10-13 23:27:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-10-13 23:27:32,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:32,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203949594] [2024-10-13 23:27:32,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203949594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:32,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:32,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:32,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355185850] [2024-10-13 23:27:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:32,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:32,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:32,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:32,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:32,935 INFO L87 Difference]: Start difference. First operand 11453 states and 12571 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:33,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:33,394 INFO L93 Difference]: Finished difference Result 24376 states and 26714 transitions. [2024-10-13 23:27:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:33,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 588 [2024-10-13 23:27:33,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:33,403 INFO L225 Difference]: With dead ends: 24376 [2024-10-13 23:27:33,404 INFO L226 Difference]: Without dead ends: 11818 [2024-10-13 23:27:33,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:33,410 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 192 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:33,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 318 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:27:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11818 states. [2024-10-13 23:27:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11818 to 11450. [2024-10-13 23:27:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11450 states, 11449 states have (on average 1.0831513669316097) internal successors, (12401), 11449 states have internal predecessors, (12401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11450 states to 11450 states and 12401 transitions. [2024-10-13 23:27:33,494 INFO L78 Accepts]: Start accepts. Automaton has 11450 states and 12401 transitions. Word has length 588 [2024-10-13 23:27:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:33,494 INFO L471 AbstractCegarLoop]: Abstraction has 11450 states and 12401 transitions. [2024-10-13 23:27:33,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 11450 states and 12401 transitions. [2024-10-13 23:27:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2024-10-13 23:27:33,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:27:33,503 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:27:33,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 23:27:33,503 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:27:33,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:27:33,503 INFO L85 PathProgramCache]: Analyzing trace with hash -952733769, now seen corresponding path program 1 times [2024-10-13 23:27:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:27:33,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70903216] [2024-10-13 23:27:33,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:27:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:27:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:27:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-10-13 23:27:33,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:27:33,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70903216] [2024-10-13 23:27:33,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70903216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:27:33,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:27:33,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:27:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161067680] [2024-10-13 23:27:33,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:27:33,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:27:33,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:27:33,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:27:33,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:33,727 INFO L87 Difference]: Start difference. First operand 11450 states and 12401 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:27:34,121 INFO L93 Difference]: Finished difference Result 23263 states and 25169 transitions. [2024-10-13 23:27:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:27:34,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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 702 [2024-10-13 23:27:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:27:34,123 INFO L225 Difference]: With dead ends: 23263 [2024-10-13 23:27:34,123 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:27:34,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:27:34,131 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 60 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:27:34,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 91 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:27:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:27:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:27:34,131 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-13 23:27:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:27:34,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 702 [2024-10-13 23:27:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:27:34,132 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:27:34,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:27:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:27:34,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:27:34,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:27:34,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 23:27:34,137 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] [2024-10-13 23:27:34,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:27:39,075 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:27:39,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:27:39 BoogieIcfgContainer [2024-10-13 23:27:39,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:27:39,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:27:39,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:27:39,104 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:27:39,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:27:03" (3/4) ... [2024-10-13 23:27:39,106 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:27:39,126 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:27:39,127 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:27:39,128 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:27:39,129 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:27:39,258 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:27:39,259 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:27:39,259 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:27:39,259 INFO L158 Benchmark]: Toolchain (without parser) took 38091.16ms. Allocated memory was 155.2MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 95.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 306.5MB. Max. memory is 16.1GB. [2024-10-13 23:27:39,259 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:27:39,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.19ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 95.5MB in the beginning and 191.4MB in the end (delta: -95.9MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-10-13 23:27:39,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.31ms. Allocated memory is still 237.0MB. Free memory was 191.4MB in the beginning and 173.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 23:27:39,260 INFO L158 Benchmark]: Boogie Preprocessor took 138.17ms. Allocated memory is still 237.0MB. Free memory was 173.6MB in the beginning and 148.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:27:39,260 INFO L158 Benchmark]: RCFGBuilder took 1305.41ms. Allocated memory is still 237.0MB. Free memory was 148.5MB in the beginning and 93.4MB in the end (delta: 55.1MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. [2024-10-13 23:27:39,261 INFO L158 Benchmark]: TraceAbstraction took 35844.33ms. Allocated memory was 237.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 93.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-13 23:27:39,261 INFO L158 Benchmark]: Witness Printer took 155.51ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 23:27:39,262 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.14ms. Allocated memory is still 155.2MB. Free memory is still 113.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.19ms. Allocated memory was 155.2MB in the beginning and 237.0MB in the end (delta: 81.8MB). Free memory was 95.5MB in the beginning and 191.4MB in the end (delta: -95.9MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.31ms. Allocated memory is still 237.0MB. Free memory was 191.4MB in the beginning and 173.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.17ms. Allocated memory is still 237.0MB. Free memory was 173.6MB in the beginning and 148.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1305.41ms. Allocated memory is still 237.0MB. Free memory was 148.5MB in the beginning and 93.4MB in the end (delta: 55.1MB). Peak memory consumption was 98.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35844.33ms. Allocated memory was 237.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 93.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 155.51ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. 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: 82]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.8s, OverallIterations: 25, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6654 SdHoareTripleChecker+Valid, 16.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6654 mSDsluCounter, 4613 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 685 mSDsCounter, 3317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21599 IncrementalHoareTripleChecker+Invalid, 24916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3317 mSolverCounterUnsat, 3928 mSDtfsCounter, 21599 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1102 GetRequests, 1047 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21036occurred in iteration=19, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 31785 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 7784 NumberOfCodeBlocks, 7784 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 7990 ConstructedInterpolants, 0 QuantifiedInterpolants, 23129 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 29 InterpolantComputations, 24 PerfectInterpolantSequences, 7555/7783 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((a29 <= 140) && (a4 == 0)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (a25 == 10)) || (((((((((long long) a29 + 21) <= 0) && (a4 == 0)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && ((a25 == 13) || (a25 == 12)))) || (((((((long long) 28300 + a29) <= 0) && (a4 == 0)) && (a3 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((((a29 <= 384312) && (278 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && ((a25 == 13) || (a25 == 12)))) || ((((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((((long long) a29 + 21) <= 0) && (a4 == 0)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (a25 == 10))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 == 11) && (278 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || (((((278 <= a29) && (a3 == 1)) && (a4 == 1)) && (a25 <= 9)) && (a8 == 15))) && (((long long) a23 + 599772) <= 0))) || (((((((a29 <= 140) && (a4 == 0)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a29 <= 384312) && (307 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && ((a25 == 13) || (a25 == 12)))) || ((((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a8 == 15)) && (a25 == 10))) || (((((((a4 == 0) && (a25 == 11)) && (278 <= a29)) && (a29 <= 599999)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((a29 <= 245) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && ((a25 == 13) || (a25 == 12)))) || ((((((((long long) a29 + 21) <= 0) && (a4 == 0)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (a3 == 1)) && (a8 == 15))) || (((((a29 <= 275) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 245) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((((((a25 == 11) && (278 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || (((((278 <= a29) && (a3 == 1)) && (a4 == 1)) && (a25 <= 9)) && (a8 == 15))) && (a23 <= 138)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 < 11) && (a3 == 1)) && (a4 == 1)) && (((long long) a29 + 287232) <= 0)) && (312 <= a23)) && (a8 == 15))) || ((((((a29 <= 384312) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((307 <= a23) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((a29 <= 599999) && ((((((278 <= a29) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10)) || (((((278 <= a29) && (a3 == 1)) && (a4 == 1)) && (a25 <= 9)) && (a8 == 15))))) || (((((((a29 <= 384312) && (a4 == 0)) && (278 <= a29)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:27:39,286 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