./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_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:19:31,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:19:31,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:19:31,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:19:31,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:19:31,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:19:31,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:19:31,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:19:31,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:19:31,526 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:19:31,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:19:31,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:19:31,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:19:31,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:19:31,527 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:19:31,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:19:31,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:19:31,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:19:31,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:19:31,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:19:31,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:19:31,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:19:31,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:19:31,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:19:31,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:19:31,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:19:31,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:19:31,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:19:31,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:19:31,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:19:31,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:19:31,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:19:31,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:31,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:19:31,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:19:31,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:19:31,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:19:31,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:19:31,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:19:31,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:19:31,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:19:31,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:19:31,537 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-clean/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-clean/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 -> 16a882266f214f7bbe3e2aa4aa7afa01c1567a6c47ab95da663021c70813ff8b [2024-10-10 23:19:31,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:19:31,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:19:31,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:19:31,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:19:31,809 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:19:31,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2024-10-10 23:19:33,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:19:33,310 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:19:33,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2024-10-10 23:19:33,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2f74ebd6a/d01ee8247682460cbec59a1e06afd447/FLAGc55e20c8a [2024-10-10 23:19:33,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2f74ebd6a/d01ee8247682460cbec59a1e06afd447 [2024-10-10 23:19:33,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:19:33,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:19:33,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:33,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:19:33,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:19:33,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:33" (1/1) ... [2024-10-10 23:19:33,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759bae67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:33, skipping insertion in model container [2024-10-10 23:19:33,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:33" (1/1) ... [2024-10-10 23:19:33,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:19:33,872 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_label44.c[3841,3854] [2024-10-10 23:19:34,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:34,092 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:19:34,113 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_label44.c[3841,3854] [2024-10-10 23:19:34,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:34,230 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:19:34,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34 WrapperNode [2024-10-10 23:19:34,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:34,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:34,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:19:34,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:19:34,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,357 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:19:34,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:34,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:19:34,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:19:34,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:19:34,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,482 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-10 23:19:34,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:19:34,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:19:34,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:19:34,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:19:34,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (1/1) ... [2024-10-10 23:19:34,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:34,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:19:34,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:19:34,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:19:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:19:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:19:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:19:34,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:19:34,740 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:19:34,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:19:35,976 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:19:35,976 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:19:36,034 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:19:36,035 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:19:36,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:36 BoogieIcfgContainer [2024-10-10 23:19:36,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:19:36,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:19:36,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:19:36,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:19:36,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:19:33" (1/3) ... [2024-10-10 23:19:36,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d27be6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:19:36, skipping insertion in model container [2024-10-10 23:19:36,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:34" (2/3) ... [2024-10-10 23:19:36,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d27be6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:19:36, skipping insertion in model container [2024-10-10 23:19:36,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:36" (3/3) ... [2024-10-10 23:19:36,043 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label44.c [2024-10-10 23:19:36,058 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:19:36,058 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:19:36,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:19:36,136 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;@420c0bcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:19:36,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:19:36,142 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-10 23:19:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 23:19:36,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:36,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:36,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:36,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash -44962428, now seen corresponding path program 1 times [2024-10-10 23:19:36,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842793259] [2024-10-10 23:19:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:36,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:36,314 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-10 23:19:36,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:36,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842793259] [2024-10-10 23:19:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842793259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:36,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:36,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:36,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399467320] [2024-10-10 23:19:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:36,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:19:36,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:36,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:19:36,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:19:36,349 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:36,393 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:19:36,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:19:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-10 23:19:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:36,407 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:19:36,408 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:19:36,410 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-10 23:19:36,413 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-10 23:19:36,414 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-10 23:19:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:19:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:19:36,453 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-10 23:19:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:19:36,455 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 25 [2024-10-10 23:19:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:36,456 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:19:36,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:19:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 23:19:36,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:36,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:36,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:19:36,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:36,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash -245136867, now seen corresponding path program 1 times [2024-10-10 23:19:36,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:36,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020648996] [2024-10-10 23:19:36,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:36,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:36,613 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-10 23:19:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020648996] [2024-10-10 23:19:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020648996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:36,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:36,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704838395] [2024-10-10 23:19:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:36,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:36,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:36,619 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:37,415 INFO L93 Difference]: Finished difference Result 633 states and 1034 transitions. [2024-10-10 23:19:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:37,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-10 23:19:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:37,418 INFO L225 Difference]: With dead ends: 633 [2024-10-10 23:19:37,418 INFO L226 Difference]: Without dead ends: 415 [2024-10-10 23:19:37,418 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-10 23:19:37,419 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 196 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:37,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 69 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:19:37,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-10 23:19:37,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 407. [2024-10-10 23:19:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.6157635467980296) internal successors, (656), 406 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 656 transitions. [2024-10-10 23:19:37,438 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 656 transitions. Word has length 25 [2024-10-10 23:19:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:37,438 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 656 transitions. [2024-10-10 23:19:37,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 656 transitions. [2024-10-10 23:19:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-10 23:19:37,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:37,441 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:19:37,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:19:37,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:37,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash -86787237, now seen corresponding path program 1 times [2024-10-10 23:19:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:37,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312914814] [2024-10-10 23:19:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:37,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312914814] [2024-10-10 23:19:37,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312914814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:37,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:37,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:37,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736254781] [2024-10-10 23:19:37,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:37,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:37,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:37,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:37,592 INFO L87 Difference]: Start difference. First operand 407 states and 656 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-10 23:19:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:38,233 INFO L93 Difference]: Finished difference Result 1190 states and 1929 transitions. [2024-10-10 23:19:38,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:38,234 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-10 23:19:38,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:38,236 INFO L225 Difference]: With dead ends: 1190 [2024-10-10 23:19:38,236 INFO L226 Difference]: Without dead ends: 784 [2024-10-10 23:19:38,238 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-10 23:19:38,239 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 141 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:38,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 150 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-10-10 23:19:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2024-10-10 23:19:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.439180537772087) internal successors, (1124), 781 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1124 transitions. [2024-10-10 23:19:38,265 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1124 transitions. Word has length 90 [2024-10-10 23:19:38,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:38,265 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1124 transitions. [2024-10-10 23:19:38,266 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-10 23:19:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1124 transitions. [2024-10-10 23:19:38,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-10 23:19:38,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:38,271 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:19:38,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:19:38,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:38,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:38,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1261300683, now seen corresponding path program 1 times [2024-10-10 23:19:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702246775] [2024-10-10 23:19:38,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:38,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702246775] [2024-10-10 23:19:38,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702246775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:38,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:38,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:38,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977315987] [2024-10-10 23:19:38,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:38,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:38,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:38,385 INFO L87 Difference]: Start difference. First operand 782 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:39,046 INFO L93 Difference]: Finished difference Result 1947 states and 2800 transitions. [2024-10-10 23:19:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:39,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-10 23:19:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:39,053 INFO L225 Difference]: With dead ends: 1947 [2024-10-10 23:19:39,054 INFO L226 Difference]: Without dead ends: 1166 [2024-10-10 23:19:39,056 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-10 23:19:39,057 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:39,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 114 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2024-10-10 23:19:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1153. [2024-10-10 23:19:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1152 states have (on average 1.3394097222222223) internal successors, (1543), 1152 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1543 transitions. [2024-10-10 23:19:39,109 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1543 transitions. Word has length 93 [2024-10-10 23:19:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:39,110 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1543 transitions. [2024-10-10 23:19:39,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1543 transitions. [2024-10-10 23:19:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-10 23:19:39,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:39,113 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:19:39,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:19:39,114 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:39,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1042194863, now seen corresponding path program 1 times [2024-10-10 23:19:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:39,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75759455] [2024-10-10 23:19:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75759455] [2024-10-10 23:19:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75759455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669741651] [2024-10-10 23:19:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:39,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:39,329 INFO L87 Difference]: Start difference. First operand 1153 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:39,947 INFO L93 Difference]: Finished difference Result 2675 states and 3528 transitions. [2024-10-10 23:19:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:39,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-10 23:19:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:39,951 INFO L225 Difference]: With dead ends: 2675 [2024-10-10 23:19:39,952 INFO L226 Difference]: Without dead ends: 1523 [2024-10-10 23:19:39,953 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-10 23:19:39,954 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:39,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 187 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-10-10 23:19:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1522. [2024-10-10 23:19:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1521 states have (on average 1.2689020381328073) internal successors, (1930), 1521 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1930 transitions. [2024-10-10 23:19:39,980 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1930 transitions. Word has length 94 [2024-10-10 23:19:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:39,980 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 1930 transitions. [2024-10-10 23:19:39,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1930 transitions. [2024-10-10 23:19:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-10 23:19:39,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:39,987 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:19:39,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:19:39,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:39,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1481029138, now seen corresponding path program 1 times [2024-10-10 23:19:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321026351] [2024-10-10 23:19:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:40,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:40,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321026351] [2024-10-10 23:19:40,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321026351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:40,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485427476] [2024-10-10 23:19:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:40,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:40,125 INFO L87 Difference]: Start difference. First operand 1522 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:40,705 INFO L93 Difference]: Finished difference Result 3967 states and 5150 transitions. [2024-10-10 23:19:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:40,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-10-10 23:19:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:40,714 INFO L225 Difference]: With dead ends: 3967 [2024-10-10 23:19:40,715 INFO L226 Difference]: Without dead ends: 2630 [2024-10-10 23:19:40,717 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-10 23:19:40,719 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:40,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 152 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2024-10-10 23:19:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2446. [2024-10-10 23:19:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2445 states have (on average 1.223721881390593) internal successors, (2992), 2445 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 2992 transitions. [2024-10-10 23:19:40,760 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 2992 transitions. Word has length 152 [2024-10-10 23:19:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:40,761 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 2992 transitions. [2024-10-10 23:19:40,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 2992 transitions. [2024-10-10 23:19:40,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-10 23:19:40,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:40,765 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:19:40,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:19:40,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:40,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash -673826994, now seen corresponding path program 1 times [2024-10-10 23:19:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374734355] [2024-10-10 23:19:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-10 23:19:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374734355] [2024-10-10 23:19:40,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374734355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:40,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:40,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204401962] [2024-10-10 23:19:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:40,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:40,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:40,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:40,965 INFO L87 Difference]: Start difference. First operand 2446 states and 2992 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:41,537 INFO L93 Difference]: Finished difference Result 5265 states and 6462 transitions. [2024-10-10 23:19:41,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 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 168 [2024-10-10 23:19:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:41,545 INFO L225 Difference]: With dead ends: 5265 [2024-10-10 23:19:41,546 INFO L226 Difference]: Without dead ends: 3004 [2024-10-10 23:19:41,549 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-10 23:19:41,549 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 75 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:41,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 151 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2024-10-10 23:19:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2819. [2024-10-10 23:19:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2818 states have (on average 1.2221433640880057) internal successors, (3444), 2818 states have internal predecessors, (3444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3444 transitions. [2024-10-10 23:19:41,592 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3444 transitions. Word has length 168 [2024-10-10 23:19:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:41,593 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3444 transitions. [2024-10-10 23:19:41,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3444 transitions. [2024-10-10 23:19:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-10 23:19:41,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:41,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:19:41,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:19:41,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:41,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash -330829423, now seen corresponding path program 1 times [2024-10-10 23:19:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:41,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627921552] [2024-10-10 23:19:41,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:41,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:41,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627921552] [2024-10-10 23:19:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627921552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:41,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:41,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:41,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913405031] [2024-10-10 23:19:41,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:41,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:41,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:41,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:41,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:41,797 INFO L87 Difference]: Start difference. First operand 2819 states and 3444 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-10 23:19:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:42,396 INFO L93 Difference]: Finished difference Result 6566 states and 8100 transitions. [2024-10-10 23:19:42,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:42,397 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 205 [2024-10-10 23:19:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:42,407 INFO L225 Difference]: With dead ends: 6566 [2024-10-10 23:19:42,407 INFO L226 Difference]: Without dead ends: 3932 [2024-10-10 23:19:42,411 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-10 23:19:42,411 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 135 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:42,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 329 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2024-10-10 23:19:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3555. [2024-10-10 23:19:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3555 states, 3554 states have (on average 1.2115925717501408) internal successors, (4306), 3554 states have internal predecessors, (4306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 4306 transitions. [2024-10-10 23:19:42,461 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 4306 transitions. Word has length 205 [2024-10-10 23:19:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:42,462 INFO L471 AbstractCegarLoop]: Abstraction has 3555 states and 4306 transitions. [2024-10-10 23:19:42,462 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-10 23:19:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 4306 transitions. [2024-10-10 23:19:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-10 23:19:42,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:42,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:19:42,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:19:42,464 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:42,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2032610421, now seen corresponding path program 1 times [2024-10-10 23:19:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:42,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241601922] [2024-10-10 23:19:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:42,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:19:42,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:42,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241601922] [2024-10-10 23:19:42,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241601922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:42,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:42,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:42,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627967195] [2024-10-10 23:19:42,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:42,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:42,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:42,665 INFO L87 Difference]: Start difference. First operand 3555 states and 4306 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:43,326 INFO L93 Difference]: Finished difference Result 9520 states and 11626 transitions. [2024-10-10 23:19:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 206 [2024-10-10 23:19:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:43,344 INFO L225 Difference]: With dead ends: 9520 [2024-10-10 23:19:43,344 INFO L226 Difference]: Without dead ends: 5966 [2024-10-10 23:19:43,348 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-10 23:19:43,350 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 200 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:43,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 329 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2024-10-10 23:19:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 5230. [2024-10-10 23:19:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5230 states, 5229 states have (on average 1.2061579651941097) internal successors, (6307), 5229 states have internal predecessors, (6307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 6307 transitions. [2024-10-10 23:19:43,444 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 6307 transitions. Word has length 206 [2024-10-10 23:19:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:43,445 INFO L471 AbstractCegarLoop]: Abstraction has 5230 states and 6307 transitions. [2024-10-10 23:19:43,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 6307 transitions. [2024-10-10 23:19:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-10 23:19:43,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:43,449 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:19:43,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:19:43,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:43,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash 491117803, now seen corresponding path program 1 times [2024-10-10 23:19:43,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:43,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507300181] [2024-10-10 23:19:43,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:43,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507300181] [2024-10-10 23:19:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507300181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:43,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:43,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990357316] [2024-10-10 23:19:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:43,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:43,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:43,675 INFO L87 Difference]: Start difference. First operand 5230 states and 6307 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:44,284 INFO L93 Difference]: Finished difference Result 10456 states and 12610 transitions. [2024-10-10 23:19:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:44,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2024-10-10 23:19:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:44,298 INFO L225 Difference]: With dead ends: 10456 [2024-10-10 23:19:44,298 INFO L226 Difference]: Without dead ends: 5227 [2024-10-10 23:19:44,304 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-10 23:19:44,305 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:44,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 301 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5227 states. [2024-10-10 23:19:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5227 to 5227. [2024-10-10 23:19:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 5226 states have (on average 1.178721775736701) internal successors, (6160), 5226 states have internal predecessors, (6160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 6160 transitions. [2024-10-10 23:19:44,379 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 6160 transitions. Word has length 243 [2024-10-10 23:19:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:44,379 INFO L471 AbstractCegarLoop]: Abstraction has 5227 states and 6160 transitions. [2024-10-10 23:19:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 6160 transitions. [2024-10-10 23:19:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-10 23:19:44,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:44,383 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:19:44,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:19:44,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:44,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash -160041176, now seen corresponding path program 1 times [2024-10-10 23:19:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861504518] [2024-10-10 23:19:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:19:44,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:44,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861504518] [2024-10-10 23:19:44,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861504518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:44,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:44,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:44,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676143386] [2024-10-10 23:19:44,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:44,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:44,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:44,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:44,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:44,595 INFO L87 Difference]: Start difference. First operand 5227 states and 6160 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:45,142 INFO L93 Difference]: Finished difference Result 11194 states and 13195 transitions. [2024-10-10 23:19:45,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 257 [2024-10-10 23:19:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:45,166 INFO L225 Difference]: With dead ends: 11194 [2024-10-10 23:19:45,169 INFO L226 Difference]: Without dead ends: 5968 [2024-10-10 23:19:45,176 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-10 23:19:45,176 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 195 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:45,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 146 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2024-10-10 23:19:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 5227. [2024-10-10 23:19:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 5226 states have (on average 1.178721775736701) internal successors, (6160), 5226 states have internal predecessors, (6160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 6160 transitions. [2024-10-10 23:19:45,261 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 6160 transitions. Word has length 257 [2024-10-10 23:19:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:45,262 INFO L471 AbstractCegarLoop]: Abstraction has 5227 states and 6160 transitions. [2024-10-10 23:19:45,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 6160 transitions. [2024-10-10 23:19:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-10 23:19:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:45,265 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:45,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:19:45,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1179120924, now seen corresponding path program 1 times [2024-10-10 23:19:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094741024] [2024-10-10 23:19:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:19:45,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094741024] [2024-10-10 23:19:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094741024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:45,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:45,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148906430] [2024-10-10 23:19:45,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:45,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:45,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:45,579 INFO L87 Difference]: Start difference. First operand 5227 states and 6160 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:46,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:46,783 INFO L93 Difference]: Finished difference Result 15806 states and 18812 transitions. [2024-10-10 23:19:46,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:46,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 260 [2024-10-10 23:19:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:46,805 INFO L225 Difference]: With dead ends: 15806 [2024-10-10 23:19:46,805 INFO L226 Difference]: Without dead ends: 10580 [2024-10-10 23:19:46,813 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-10 23:19:46,813 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 237 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:46,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 113 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:19:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10580 states. [2024-10-10 23:19:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10580 to 10018. [2024-10-10 23:19:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10018 states, 10017 states have (on average 1.180293501048218) internal successors, (11823), 10017 states have internal predecessors, (11823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10018 states to 10018 states and 11823 transitions. [2024-10-10 23:19:46,955 INFO L78 Accepts]: Start accepts. Automaton has 10018 states and 11823 transitions. Word has length 260 [2024-10-10 23:19:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:46,956 INFO L471 AbstractCegarLoop]: Abstraction has 10018 states and 11823 transitions. [2024-10-10 23:19:46,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 10018 states and 11823 transitions. [2024-10-10 23:19:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-10 23:19:46,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:46,960 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:19:46,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:19:46,960 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:46,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1753312156, now seen corresponding path program 1 times [2024-10-10 23:19:46,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:46,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021270902] [2024-10-10 23:19:46,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021270902] [2024-10-10 23:19:47,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021270902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:47,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:47,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364881247] [2024-10-10 23:19:47,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:47,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:47,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:47,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:47,130 INFO L87 Difference]: Start difference. First operand 10018 states and 11823 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:48,151 INFO L93 Difference]: Finished difference Result 25579 states and 30140 transitions. [2024-10-10 23:19:48,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:48,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2024-10-10 23:19:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:48,177 INFO L225 Difference]: With dead ends: 25579 [2024-10-10 23:19:48,177 INFO L226 Difference]: Without dead ends: 15930 [2024-10-10 23:19:48,187 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-10 23:19:48,188 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 239 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:48,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 81 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:19:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15930 states. [2024-10-10 23:19:48,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15930 to 15744. [2024-10-10 23:19:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15744 states, 15743 states have (on average 1.1689639839928858) internal successors, (18403), 15743 states have internal predecessors, (18403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15744 states to 15744 states and 18403 transitions. [2024-10-10 23:19:48,364 INFO L78 Accepts]: Start accepts. Automaton has 15744 states and 18403 transitions. Word has length 269 [2024-10-10 23:19:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:48,365 INFO L471 AbstractCegarLoop]: Abstraction has 15744 states and 18403 transitions. [2024-10-10 23:19:48,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15744 states and 18403 transitions. [2024-10-10 23:19:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-10 23:19:48,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:48,369 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:19:48,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:19:48,370 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:48,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -181670248, now seen corresponding path program 1 times [2024-10-10 23:19:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547281349] [2024-10-10 23:19:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:48,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-10-10 23:19:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:48,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547281349] [2024-10-10 23:19:48,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547281349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:48,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:48,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:48,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84976186] [2024-10-10 23:19:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:48,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:48,532 INFO L87 Difference]: Start difference. First operand 15744 states and 18403 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:49,098 INFO L93 Difference]: Finished difference Result 32402 states and 37949 transitions. [2024-10-10 23:19:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:49,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 280 [2024-10-10 23:19:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:49,126 INFO L225 Difference]: With dead ends: 32402 [2024-10-10 23:19:49,126 INFO L226 Difference]: Without dead ends: 18135 [2024-10-10 23:19:49,141 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-10 23:19:49,142 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 192 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:49,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 149 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18135 states. [2024-10-10 23:19:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18135 to 13159. [2024-10-10 23:19:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13159 states, 13158 states have (on average 1.1722146222830216) internal successors, (15424), 13158 states have internal predecessors, (15424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 15424 transitions. [2024-10-10 23:19:49,401 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 15424 transitions. Word has length 280 [2024-10-10 23:19:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:49,402 INFO L471 AbstractCegarLoop]: Abstraction has 13159 states and 15424 transitions. [2024-10-10 23:19:49,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 15424 transitions. [2024-10-10 23:19:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-10-10 23:19:49,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:49,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:49,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:19:49,408 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:49,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash -501075488, now seen corresponding path program 1 times [2024-10-10 23:19:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288688638] [2024-10-10 23:19:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:49,526 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:19:49,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:49,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288688638] [2024-10-10 23:19:49,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288688638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:49,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:49,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:49,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765848725] [2024-10-10 23:19:49,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:49,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:49,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:49,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:49,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:49,528 INFO L87 Difference]: Start difference. First operand 13159 states and 15424 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:50,169 INFO L93 Difference]: Finished difference Result 28712 states and 33937 transitions. [2024-10-10 23:19:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:50,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2024-10-10 23:19:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:50,194 INFO L225 Difference]: With dead ends: 28712 [2024-10-10 23:19:50,194 INFO L226 Difference]: Without dead ends: 15922 [2024-10-10 23:19:50,205 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-10 23:19:50,205 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 180 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:50,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 157 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15922 states. [2024-10-10 23:19:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15922 to 13144. [2024-10-10 23:19:50,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13144 states, 13143 states have (on average 1.151791828349692) internal successors, (15138), 13143 states have internal predecessors, (15138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13144 states to 13144 states and 15138 transitions. [2024-10-10 23:19:50,403 INFO L78 Accepts]: Start accepts. Automaton has 13144 states and 15138 transitions. Word has length 300 [2024-10-10 23:19:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:50,404 INFO L471 AbstractCegarLoop]: Abstraction has 13144 states and 15138 transitions. [2024-10-10 23:19:50,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13144 states and 15138 transitions. [2024-10-10 23:19:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-10 23:19:50,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:50,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:19:50,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:19:50,412 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:50,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash -43649468, now seen corresponding path program 1 times [2024-10-10 23:19:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:50,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819715777] [2024-10-10 23:19:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:50,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-10 23:19:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819715777] [2024-10-10 23:19:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819715777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:50,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364138235] [2024-10-10 23:19:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:50,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:50,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:50,604 INFO L87 Difference]: Start difference. First operand 13144 states and 15138 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:50,905 INFO L93 Difference]: Finished difference Result 25171 states and 28966 transitions. [2024-10-10 23:19:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:50,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 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 307 [2024-10-10 23:19:50,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:50,921 INFO L225 Difference]: With dead ends: 25171 [2024-10-10 23:19:50,921 INFO L226 Difference]: Without dead ends: 12396 [2024-10-10 23:19:50,930 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-10 23:19:50,930 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:50,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 35 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 23:19:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12396 states. [2024-10-10 23:19:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12396 to 12394. [2024-10-10 23:19:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12394 states, 12393 states have (on average 1.1461308803356733) internal successors, (14204), 12393 states have internal predecessors, (14204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12394 states to 12394 states and 14204 transitions. [2024-10-10 23:19:51,110 INFO L78 Accepts]: Start accepts. Automaton has 12394 states and 14204 transitions. Word has length 307 [2024-10-10 23:19:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:51,110 INFO L471 AbstractCegarLoop]: Abstraction has 12394 states and 14204 transitions. [2024-10-10 23:19:51,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 12394 states and 14204 transitions. [2024-10-10 23:19:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-10-10 23:19:51,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:51,116 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:51,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:19:51,116 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:51,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash 697630297, now seen corresponding path program 1 times [2024-10-10 23:19:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:51,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171105362] [2024-10-10 23:19:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:51,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-10-10 23:19:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:51,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171105362] [2024-10-10 23:19:51,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171105362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:51,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:51,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118845035] [2024-10-10 23:19:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:51,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:51,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:51,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:51,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:51,361 INFO L87 Difference]: Start difference. First operand 12394 states and 14204 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:52,027 INFO L93 Difference]: Finished difference Result 27737 states and 31820 transitions. [2024-10-10 23:19:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:52,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 329 [2024-10-10 23:19:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:52,047 INFO L225 Difference]: With dead ends: 27737 [2024-10-10 23:19:52,047 INFO L226 Difference]: Without dead ends: 15712 [2024-10-10 23:19:52,056 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-10 23:19:52,057 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 179 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:52,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 354 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15712 states. [2024-10-10 23:19:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15712 to 13686. [2024-10-10 23:19:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13686 states, 13685 states have (on average 1.1305078553160395) internal successors, (15471), 13685 states have internal predecessors, (15471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13686 states to 13686 states and 15471 transitions. [2024-10-10 23:19:52,257 INFO L78 Accepts]: Start accepts. Automaton has 13686 states and 15471 transitions. Word has length 329 [2024-10-10 23:19:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:52,257 INFO L471 AbstractCegarLoop]: Abstraction has 13686 states and 15471 transitions. [2024-10-10 23:19:52,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 13686 states and 15471 transitions. [2024-10-10 23:19:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-10-10 23:19:52,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:52,264 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:52,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:19:52,264 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:52,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:52,264 INFO L85 PathProgramCache]: Analyzing trace with hash 211286778, now seen corresponding path program 1 times [2024-10-10 23:19:52,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:52,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223306864] [2024-10-10 23:19:52,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-10-10 23:19:52,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:52,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223306864] [2024-10-10 23:19:52,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223306864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:52,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:52,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062930521] [2024-10-10 23:19:52,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:52,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:52,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:52,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:52,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:52,394 INFO L87 Difference]: Start difference. First operand 13686 states and 15471 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:52,928 INFO L93 Difference]: Finished difference Result 27921 states and 31576 transitions. [2024-10-10 23:19:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:52,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 336 [2024-10-10 23:19:52,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:52,930 INFO L225 Difference]: With dead ends: 27921 [2024-10-10 23:19:52,930 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:19:52,940 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-10 23:19:52,940 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 188 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:52,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 302 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:52,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:19:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:19:52,941 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-10 23:19:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:19:52,942 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 336 [2024-10-10 23:19:52,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:52,942 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:19:52,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:19:52,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:19:52,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:19:52,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:19:52,947 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:52,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:19:54,581 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:19:54,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:19:54 BoogieIcfgContainer [2024-10-10 23:19:54,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:19:54,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:19:54,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:19:54,597 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:19:54,597 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:36" (3/4) ... [2024-10-10 23:19:54,599 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:19:54,618 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:19:54,619 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:19:54,620 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:19:54,620 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:19:54,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:19:54,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:19:54,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:19:54,773 INFO L158 Benchmark]: Toolchain (without parser) took 21141.49ms. Allocated memory was 163.6MB in the beginning and 654.3MB in the end (delta: 490.7MB). Free memory was 124.3MB in the beginning and 270.0MB in the end (delta: -145.7MB). Peak memory consumption was 345.8MB. Max. memory is 16.1GB. [2024-10-10 23:19:54,774 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:19:54,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.42ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 76.9MB in the end (delta: 47.4MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-10 23:19:54,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.54ms. Allocated memory is still 163.6MB. Free memory was 76.9MB in the beginning and 59.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:19:54,774 INFO L158 Benchmark]: Boogie Preprocessor took 252.23ms. Allocated memory is still 163.6MB. Free memory was 59.3MB in the beginning and 115.3MB in the end (delta: -56.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-10-10 23:19:54,774 INFO L158 Benchmark]: RCFGBuilder took 1424.81ms. Allocated memory was 163.6MB in the beginning and 251.7MB in the end (delta: 88.1MB). Free memory was 115.3MB in the beginning and 162.5MB in the end (delta: -47.2MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2024-10-10 23:19:54,775 INFO L158 Benchmark]: TraceAbstraction took 18558.96ms. Allocated memory was 251.7MB in the beginning and 654.3MB in the end (delta: 402.7MB). Free memory was 161.5MB in the beginning and 286.7MB in the end (delta: -125.3MB). Peak memory consumption was 410.0MB. Max. memory is 16.1GB. [2024-10-10 23:19:54,775 INFO L158 Benchmark]: Witness Printer took 176.16ms. Allocated memory is still 654.3MB. Free memory was 286.7MB in the beginning and 270.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:19:54,777 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.18ms. Allocated memory is still 113.2MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.42ms. Allocated memory is still 163.6MB. Free memory was 124.3MB in the beginning and 76.9MB in the end (delta: 47.4MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.54ms. Allocated memory is still 163.6MB. Free memory was 76.9MB in the beginning and 59.3MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 252.23ms. Allocated memory is still 163.6MB. Free memory was 59.3MB in the beginning and 115.3MB in the end (delta: -56.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1424.81ms. Allocated memory was 163.6MB in the beginning and 251.7MB in the end (delta: 88.1MB). Free memory was 115.3MB in the beginning and 162.5MB in the end (delta: -47.2MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18558.96ms. Allocated memory was 251.7MB in the beginning and 654.3MB in the end (delta: 402.7MB). Free memory was 161.5MB in the beginning and 286.7MB in the end (delta: -125.3MB). Peak memory consumption was 410.0MB. Max. memory is 16.1GB. * Witness Printer took 176.16ms. Allocated memory is still 654.3MB. Free memory was 286.7MB in the beginning and 270.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 94]: 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: 16.8s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2864 SdHoareTripleChecker+Valid, 10.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2864 mSDsluCounter, 3474 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 376 mSDsCounter, 1611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10089 IncrementalHoareTripleChecker+Invalid, 11700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1611 mSolverCounterUnsat, 3098 mSDtfsCounter, 10089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15744occurred in iteration=13, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 12777 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 3639 NumberOfCodeBlocks, 3639 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3621 ConstructedInterpolants, 0 QuantifiedInterpolants, 7325 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2190/2190 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: (((((((((((((a4 == 1) && (a8 == 15)) && (247 <= a29)) || (((10 <= a25) && (a4 == 1)) && (a8 == 15))) || ((((a4 == 0) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || (((((10 <= a25) && (a4 == 0)) && (a23 <= 138)) && (a8 == 15)) && (247 <= a29))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 138)) && (a8 == 15))) || (((a25 == 12) && (a4 == 0)) && (a8 == 15))) || (((a23 <= 138) && (a4 == 1)) && (a8 == 15))) || (((a29 <= 140) && (a4 == 1)) && (a8 == 15))) || ((((262 <= a29) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) || (((307 <= a23) && (a4 == 1)) && (a8 == 15))) || ((((10 <= a25) && (a4 == 0)) && (a8 == 15)) && (a23 <= 137))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:19:54,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE