./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label39.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e4f61af9a0cb0797f7e34da0b07a857e7ae44f0a7943fff0d2a78c0cd17574b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:28:12,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:28:12,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:28:12,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:28:12,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:28:12,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:28:12,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:28:12,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:28:12,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:28:12,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:28:12,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:28:12,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:28:12,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:28:12,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:28:12,294 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:28:12,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:28:12,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:28:12,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:28:12,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:28:12,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:28:12,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:28:12,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:28:12,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:28:12,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:28:12,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:28:12,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:28:12,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:28:12,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:28:12,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:28:12,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:28:12,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:28:12,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:28:12,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:12,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:28:12,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:28:12,305 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:28:12,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:28:12,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:28:12,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:28:12,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:28:12,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:28:12,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:28:12,308 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e4f61af9a0cb0797f7e34da0b07a857e7ae44f0a7943fff0d2a78c0cd17574b [2024-11-08 10:28:12,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:28:12,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:28:12,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:28:12,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:28:12,617 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:28:12,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2024-11-08 10:28:14,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:28:14,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:28:14,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2024-11-08 10:28:14,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6263a5693/091db6e5590444539d18e1e1f6a7943e/FLAG309265c2c [2024-11-08 10:28:14,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6263a5693/091db6e5590444539d18e1e1f6a7943e [2024-11-08 10:28:14,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:28:14,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:28:14,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:14,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:28:14,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:28:14,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:14,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e84ed85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14, skipping insertion in model container [2024-11-08 10:28:14,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:14,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:28:14,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label39.c[18036,18049] [2024-11-08 10:28:14,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:14,793 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:28:14,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label39.c[18036,18049] [2024-11-08 10:28:14,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:28:14,914 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:28:14,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14 WrapperNode [2024-11-08 10:28:14,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:28:14,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:14,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:28:14,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:28:14,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:14,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:14,982 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-08 10:28:14,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:28:14,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:28:14,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:28:14,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:28:14,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:14,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,029 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:28:15,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:28:15,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:28:15,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:28:15,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:28:15,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (1/1) ... [2024-11-08 10:28:15,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:28:15,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:28:15,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:28:15,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:28:15,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:28:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:28:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:28:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:28:15,247 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:28:15,250 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:28:16,247 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-08 10:28:16,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:28:16,264 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:28:16,264 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 10:28:16,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:16 BoogieIcfgContainer [2024-11-08 10:28:16,265 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:28:16,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:28:16,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:28:16,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:28:16,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:28:14" (1/3) ... [2024-11-08 10:28:16,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e56b8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:16, skipping insertion in model container [2024-11-08 10:28:16,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:28:14" (2/3) ... [2024-11-08 10:28:16,269 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e56b8d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:28:16, skipping insertion in model container [2024-11-08 10:28:16,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:16" (3/3) ... [2024-11-08 10:28:16,270 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39.c [2024-11-08 10:28:16,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:28:16,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:28:16,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:28:16,344 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;@3372a7d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:28:16,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:28:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:16,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-08 10:28:16,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:16,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:16,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:16,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1738135197, now seen corresponding path program 1 times [2024-11-08 10:28:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933598394] [2024-11-08 10:28:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:16,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933598394] [2024-11-08 10:28:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933598394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:16,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:16,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563077940] [2024-11-08 10:28:16,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:16,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:16,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:16,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:16,990 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:17,767 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2024-11-08 10:28:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:17,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-08 10:28:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:17,779 INFO L225 Difference]: With dead ends: 630 [2024-11-08 10:28:17,779 INFO L226 Difference]: Without dead ends: 318 [2024-11-08 10:28:17,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:17,789 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:17,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:28:17,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-08 10:28:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-08 10:28:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2024-11-08 10:28:17,854 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 111 [2024-11-08 10:28:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:17,855 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2024-11-08 10:28:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2024-11-08 10:28:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 10:28:17,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:17,860 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 10:28:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:28:17,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:17,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash -215551336, now seen corresponding path program 1 times [2024-11-08 10:28:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:17,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191374684] [2024-11-08 10:28:17,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:18,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191374684] [2024-11-08 10:28:18,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191374684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:18,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111680774] [2024-11-08 10:28:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:18,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:28:18,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:28:18,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:28:18,307 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:18,976 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2024-11-08 10:28:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:28:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-08 10:28:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:18,980 INFO L225 Difference]: With dead ends: 999 [2024-11-08 10:28:18,980 INFO L226 Difference]: Without dead ends: 600 [2024-11-08 10:28:18,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:28:18,982 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 171 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:18,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:28:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-08 10:28:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-08 10:28:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.358931552587646) internal successors, (814), 599 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 814 transitions. [2024-11-08 10:28:19,008 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 814 transitions. Word has length 115 [2024-11-08 10:28:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:19,009 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 814 transitions. [2024-11-08 10:28:19,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 814 transitions. [2024-11-08 10:28:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 10:28:19,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:19,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:19,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:28:19,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:19,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:19,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1229678270, now seen corresponding path program 1 times [2024-11-08 10:28:19,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525600703] [2024-11-08 10:28:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:19,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:19,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:19,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525600703] [2024-11-08 10:28:19,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525600703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:19,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680305850] [2024-11-08 10:28:19,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:19,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:19,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:19,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:19,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:19,146 INFO L87 Difference]: Start difference. First operand 600 states and 814 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:19,546 INFO L93 Difference]: Finished difference Result 1779 states and 2420 transitions. [2024-11-08 10:28:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:19,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-11-08 10:28:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:19,551 INFO L225 Difference]: With dead ends: 1779 [2024-11-08 10:28:19,551 INFO L226 Difference]: Without dead ends: 1181 [2024-11-08 10:28:19,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:19,554 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:19,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 100 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2024-11-08 10:28:19,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1173. [2024-11-08 10:28:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.3114334470989761) internal successors, (1537), 1172 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1537 transitions. [2024-11-08 10:28:19,585 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1537 transitions. Word has length 129 [2024-11-08 10:28:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:19,585 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1537 transitions. [2024-11-08 10:28:19,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1537 transitions. [2024-11-08 10:28:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 10:28:19,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:19,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-08 10:28:19,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:28:19,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1106094347, now seen corresponding path program 1 times [2024-11-08 10:28:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020578321] [2024-11-08 10:28:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:19,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:28:19,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:19,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020578321] [2024-11-08 10:28:19,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020578321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:19,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:19,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 10:28:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255161036] [2024-11-08 10:28:19,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:19,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:19,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:19,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:19,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:19,716 INFO L87 Difference]: Start difference. First operand 1173 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:20,191 INFO L93 Difference]: Finished difference Result 3329 states and 4387 transitions. [2024-11-08 10:28:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:20,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 141 [2024-11-08 10:28:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:20,198 INFO L225 Difference]: With dead ends: 3329 [2024-11-08 10:28:20,199 INFO L226 Difference]: Without dead ends: 2158 [2024-11-08 10:28:20,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:20,205 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 126 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:20,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 127 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2024-11-08 10:28:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2024-11-08 10:28:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.200557103064067) internal successors, (2586), 2154 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2586 transitions. [2024-11-08 10:28:20,249 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2586 transitions. Word has length 141 [2024-11-08 10:28:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:20,250 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2586 transitions. [2024-11-08 10:28:20,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2586 transitions. [2024-11-08 10:28:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 10:28:20,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:20,257 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:20,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:28:20,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:20,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1261230373, now seen corresponding path program 1 times [2024-11-08 10:28:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:20,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566959260] [2024-11-08 10:28:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 10:28:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566959260] [2024-11-08 10:28:20,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566959260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:20,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971991897] [2024-11-08 10:28:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:20,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:20,423 INFO L87 Difference]: Start difference. First operand 2155 states and 2586 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:20,863 INFO L93 Difference]: Finished difference Result 5309 states and 6453 transitions. [2024-11-08 10:28:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:20,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-11-08 10:28:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:20,874 INFO L225 Difference]: With dead ends: 5309 [2024-11-08 10:28:20,874 INFO L226 Difference]: Without dead ends: 3156 [2024-11-08 10:28:20,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:20,880 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 158 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:20,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 254 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2024-11-08 10:28:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 2876. [2024-11-08 10:28:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2875 states have (on average 1.1822608695652175) internal successors, (3399), 2875 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3399 transitions. [2024-11-08 10:28:20,934 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3399 transitions. Word has length 144 [2024-11-08 10:28:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:20,935 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 3399 transitions. [2024-11-08 10:28:20,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:20,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3399 transitions. [2024-11-08 10:28:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 10:28:20,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:20,940 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:20,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:28:20,941 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:20,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -39522805, now seen corresponding path program 1 times [2024-11-08 10:28:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:20,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156176644] [2024-11-08 10:28:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:21,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:21,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156176644] [2024-11-08 10:28:21,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156176644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:21,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:21,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:21,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678141619] [2024-11-08 10:28:21,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:21,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:21,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:21,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:21,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:21,079 INFO L87 Difference]: Start difference. First operand 2876 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:21,592 INFO L93 Difference]: Finished difference Result 6735 states and 8088 transitions. [2024-11-08 10:28:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-08 10:28:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:21,606 INFO L225 Difference]: With dead ends: 6735 [2024-11-08 10:28:21,606 INFO L226 Difference]: Without dead ends: 3861 [2024-11-08 10:28:21,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:21,611 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:21,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 59 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:28:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2024-11-08 10:28:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3714. [2024-11-08 10:28:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3713 states have (on average 1.2011850255857797) internal successors, (4460), 3713 states have internal predecessors, (4460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:21,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4460 transitions. [2024-11-08 10:28:21,683 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4460 transitions. Word has length 147 [2024-11-08 10:28:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:21,684 INFO L471 AbstractCegarLoop]: Abstraction has 3714 states and 4460 transitions. [2024-11-08 10:28:21,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4460 transitions. [2024-11-08 10:28:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 10:28:21,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:21,689 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 10:28:21,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -35348223, now seen corresponding path program 1 times [2024-11-08 10:28:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77051733] [2024-11-08 10:28:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:21,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:21,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77051733] [2024-11-08 10:28:21,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77051733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:21,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:21,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:21,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735291344] [2024-11-08 10:28:21,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:21,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:21,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:21,774 INFO L87 Difference]: Start difference. First operand 3714 states and 4460 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:22,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:22,229 INFO L93 Difference]: Finished difference Result 7573 states and 9010 transitions. [2024-11-08 10:28:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:22,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2024-11-08 10:28:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:22,240 INFO L225 Difference]: With dead ends: 7573 [2024-11-08 10:28:22,240 INFO L226 Difference]: Without dead ends: 3721 [2024-11-08 10:28:22,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:22,245 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 138 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:22,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 281 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-11-08 10:28:22,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3423. [2024-11-08 10:28:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 3422 states have (on average 1.1531268264172998) internal successors, (3946), 3422 states have internal predecessors, (3946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 3946 transitions. [2024-11-08 10:28:22,300 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 3946 transitions. Word has length 151 [2024-11-08 10:28:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:22,300 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 3946 transitions. [2024-11-08 10:28:22,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 3946 transitions. [2024-11-08 10:28:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 10:28:22,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:22,306 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:22,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:28:22,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:22,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash 96919813, now seen corresponding path program 1 times [2024-11-08 10:28:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5232673] [2024-11-08 10:28:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:22,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 10:28:22,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5232673] [2024-11-08 10:28:22,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5232673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:22,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:22,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:22,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521657014] [2024-11-08 10:28:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:22,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:22,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:22,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:22,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:22,427 INFO L87 Difference]: Start difference. First operand 3423 states and 3946 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:22,867 INFO L93 Difference]: Finished difference Result 7821 states and 9061 transitions. [2024-11-08 10:28:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:22,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 158 [2024-11-08 10:28:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:22,876 INFO L225 Difference]: With dead ends: 7821 [2024-11-08 10:28:22,877 INFO L226 Difference]: Without dead ends: 2987 [2024-11-08 10:28:22,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:22,882 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 124 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:22,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 262 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2024-11-08 10:28:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2987. [2024-11-08 10:28:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2986 states have (on average 1.1121902210314802) internal successors, (3321), 2986 states have internal predecessors, (3321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3321 transitions. [2024-11-08 10:28:22,944 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3321 transitions. Word has length 158 [2024-11-08 10:28:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:22,945 INFO L471 AbstractCegarLoop]: Abstraction has 2987 states and 3321 transitions. [2024-11-08 10:28:22,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3321 transitions. [2024-11-08 10:28:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 10:28:22,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:22,950 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:28:22,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:28:22,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:22,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:22,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1697406424, now seen corresponding path program 1 times [2024-11-08 10:28:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:22,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626638420] [2024-11-08 10:28:22,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:22,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 10:28:23,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626638420] [2024-11-08 10:28:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626638420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:23,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978529569] [2024-11-08 10:28:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:23,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:23,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:23,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:23,071 INFO L87 Difference]: Start difference. First operand 2987 states and 3321 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:23,450 INFO L93 Difference]: Finished difference Result 6113 states and 6793 transitions. [2024-11-08 10:28:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:23,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-11-08 10:28:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:23,463 INFO L225 Difference]: With dead ends: 6113 [2024-11-08 10:28:23,464 INFO L226 Difference]: Without dead ends: 3128 [2024-11-08 10:28:23,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:23,468 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:23,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 233 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:28:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2024-11-08 10:28:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3127. [2024-11-08 10:28:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 3126 states have (on average 1.099488163787588) internal successors, (3437), 3126 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 3437 transitions. [2024-11-08 10:28:23,520 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 3437 transitions. Word has length 172 [2024-11-08 10:28:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:23,520 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 3437 transitions. [2024-11-08 10:28:23,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:23,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 3437 transitions. [2024-11-08 10:28:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 10:28:23,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:23,526 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 10:28:23,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:28:23,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:23,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1661181254, now seen corresponding path program 1 times [2024-11-08 10:28:23,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:23,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756078344] [2024-11-08 10:28:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:23,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 10:28:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756078344] [2024-11-08 10:28:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756078344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:23,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:23,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426212659] [2024-11-08 10:28:23,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:23,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:23,668 INFO L87 Difference]: Start difference. First operand 3127 states and 3437 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:24,080 INFO L93 Difference]: Finished difference Result 7376 states and 8187 transitions. [2024-11-08 10:28:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:24,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 193 [2024-11-08 10:28:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:24,094 INFO L225 Difference]: With dead ends: 7376 [2024-11-08 10:28:24,094 INFO L226 Difference]: Without dead ends: 4251 [2024-11-08 10:28:24,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:24,098 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 131 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:24,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 206 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2024-11-08 10:28:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4249. [2024-11-08 10:28:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 4248 states have (on average 1.0995762711864407) internal successors, (4671), 4248 states have internal predecessors, (4671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 4671 transitions. [2024-11-08 10:28:24,163 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 4671 transitions. Word has length 193 [2024-11-08 10:28:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:24,164 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 4671 transitions. [2024-11-08 10:28:24,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 4671 transitions. [2024-11-08 10:28:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 10:28:24,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:24,172 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 10:28:24,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 10:28:24,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:24,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -981115828, now seen corresponding path program 1 times [2024-11-08 10:28:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403784536] [2024-11-08 10:28:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-08 10:28:24,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:24,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403784536] [2024-11-08 10:28:24,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403784536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:24,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:24,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:24,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59887487] [2024-11-08 10:28:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:24,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:24,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:24,365 INFO L87 Difference]: Start difference. First operand 4249 states and 4671 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:24,769 INFO L93 Difference]: Finished difference Result 9196 states and 10094 transitions. [2024-11-08 10:28:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:24,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 227 [2024-11-08 10:28:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:24,788 INFO L225 Difference]: With dead ends: 9196 [2024-11-08 10:28:24,788 INFO L226 Difference]: Without dead ends: 4247 [2024-11-08 10:28:24,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:24,794 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 82 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:24,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 219 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:28:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2024-11-08 10:28:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4107. [2024-11-08 10:28:24,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4107 states, 4106 states have (on average 1.0606429615197273) internal successors, (4355), 4106 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 4355 transitions. [2024-11-08 10:28:24,869 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 4355 transitions. Word has length 227 [2024-11-08 10:28:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:24,869 INFO L471 AbstractCegarLoop]: Abstraction has 4107 states and 4355 transitions. [2024-11-08 10:28:24,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 4355 transitions. [2024-11-08 10:28:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-08 10:28:24,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:24,877 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:24,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 10:28:24,877 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:24,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1369005853, now seen corresponding path program 1 times [2024-11-08 10:28:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97727097] [2024-11-08 10:28:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 10:28:25,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:25,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97727097] [2024-11-08 10:28:25,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97727097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:25,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:25,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620848846] [2024-11-08 10:28:25,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:25,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:25,007 INFO L87 Difference]: Start difference. First operand 4107 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:25,354 INFO L93 Difference]: Finished difference Result 6510 states and 6850 transitions. [2024-11-08 10:28:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:25,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 245 [2024-11-08 10:28:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:25,368 INFO L225 Difference]: With dead ends: 6510 [2024-11-08 10:28:25,368 INFO L226 Difference]: Without dead ends: 2405 [2024-11-08 10:28:25,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:25,375 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 152 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:25,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 46 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:28:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2024-11-08 10:28:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2265. [2024-11-08 10:28:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.0331272084805654) internal successors, (2339), 2264 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2339 transitions. [2024-11-08 10:28:25,403 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2339 transitions. Word has length 245 [2024-11-08 10:28:25,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:25,404 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 2339 transitions. [2024-11-08 10:28:25,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2339 transitions. [2024-11-08 10:28:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 10:28:25,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:25,409 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:25,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 10:28:25,409 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:25,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:25,410 INFO L85 PathProgramCache]: Analyzing trace with hash 995979598, now seen corresponding path program 1 times [2024-11-08 10:28:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:25,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579997259] [2024-11-08 10:28:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 10:28:25,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:25,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579997259] [2024-11-08 10:28:25,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579997259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:25,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:25,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:28:25,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551643167] [2024-11-08 10:28:25,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:25,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:28:25,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:25,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:28:25,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:28:25,678 INFO L87 Difference]: Start difference. First operand 2265 states and 2339 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:26,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:26,251 INFO L93 Difference]: Finished difference Result 4387 states and 4531 transitions. [2024-11-08 10:28:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:28:26,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 246 [2024-11-08 10:28:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:26,256 INFO L225 Difference]: With dead ends: 4387 [2024-11-08 10:28:26,256 INFO L226 Difference]: Without dead ends: 2264 [2024-11-08 10:28:26,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:28:26,260 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 218 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:26,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 220 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 10:28:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-11-08 10:28:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1981. [2024-11-08 10:28:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1980 states have (on average 1.0328282828282829) internal successors, (2045), 1980 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2045 transitions. [2024-11-08 10:28:26,285 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2045 transitions. Word has length 246 [2024-11-08 10:28:26,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:26,285 INFO L471 AbstractCegarLoop]: Abstraction has 1981 states and 2045 transitions. [2024-11-08 10:28:26,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2045 transitions. [2024-11-08 10:28:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-08 10:28:26,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:28:26,290 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 2, 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] [2024-11-08 10:28:26,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:28:26,291 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:28:26,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:28:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1088030914, now seen corresponding path program 1 times [2024-11-08 10:28:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:28:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314023374] [2024-11-08 10:28:26,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:28:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:28:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:28:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-08 10:28:26,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:28:26,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314023374] [2024-11-08 10:28:26,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314023374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:28:26,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:28:26,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:28:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041711155] [2024-11-08 10:28:26,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:28:26,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:28:26,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:28:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:28:26,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:26,423 INFO L87 Difference]: Start difference. First operand 1981 states and 2045 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:28:26,720 INFO L93 Difference]: Finished difference Result 2401 states and 2476 transitions. [2024-11-08 10:28:26,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:28:26,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 268 [2024-11-08 10:28:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:28:26,722 INFO L225 Difference]: With dead ends: 2401 [2024-11-08 10:28:26,722 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 10:28:26,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:28:26,724 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 101 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:28:26,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 191 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:28:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 10:28:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 10:28:26,726 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-11-08 10:28:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 10:28:26,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2024-11-08 10:28:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:28:26,727 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 10:28:26,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 10:28:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 10:28:26,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 10:28:26,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:28:26,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:28:26,735 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:28:26,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 10:28:27,189 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:28:27,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:28:27 BoogieIcfgContainer [2024-11-08 10:28:27,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:28:27,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:28:27,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:28:27,216 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:28:27,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:28:16" (3/4) ... [2024-11-08 10:28:27,219 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 10:28:27,240 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 10:28:27,241 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 10:28:27,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 10:28:27,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 10:28:27,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:28:27,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 10:28:27,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:28:27,399 INFO L158 Benchmark]: Toolchain (without parser) took 13033.99ms. Allocated memory was 146.8MB in the beginning and 308.3MB in the end (delta: 161.5MB). Free memory was 73.9MB in the beginning and 178.0MB in the end (delta: -104.1MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-11-08 10:28:27,400 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:28:27,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.86ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 73.7MB in the beginning and 174.4MB in the end (delta: -100.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-08 10:28:27,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.44ms. Allocated memory is still 211.8MB. Free memory was 174.4MB in the beginning and 168.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:28:27,402 INFO L158 Benchmark]: Boogie Preprocessor took 103.03ms. Allocated memory is still 211.8MB. Free memory was 168.1MB in the beginning and 162.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:28:27,402 INFO L158 Benchmark]: RCFGBuilder took 1177.28ms. Allocated memory is still 211.8MB. Free memory was 162.9MB in the beginning and 81.1MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-08 10:28:27,402 INFO L158 Benchmark]: TraceAbstraction took 10949.10ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 80.1MB in the beginning and 190.6MB in the end (delta: -110.5MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2024-11-08 10:28:27,403 INFO L158 Benchmark]: Witness Printer took 183.04ms. Allocated memory is still 308.3MB. Free memory was 190.6MB in the beginning and 178.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 10:28:27,407 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.23ms. Allocated memory is still 146.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 546.86ms. Allocated memory was 146.8MB in the beginning and 211.8MB in the end (delta: 65.0MB). Free memory was 73.7MB in the beginning and 174.4MB in the end (delta: -100.7MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.44ms. Allocated memory is still 211.8MB. Free memory was 174.4MB in the beginning and 168.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.03ms. Allocated memory is still 211.8MB. Free memory was 168.1MB in the beginning and 162.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1177.28ms. Allocated memory is still 211.8MB. Free memory was 162.9MB in the beginning and 81.1MB in the end (delta: 81.8MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10949.10ms. Allocated memory was 211.8MB in the beginning and 308.3MB in the end (delta: 96.5MB). Free memory was 80.1MB in the beginning and 190.6MB in the end (delta: -110.5MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. * Witness Printer took 183.04ms. Allocated memory is still 308.3MB. Free memory was 190.6MB in the beginning and 178.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 515]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1939 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1939 mSDsluCounter, 2430 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 841 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5641 IncrementalHoareTripleChecker+Invalid, 6482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 841 mSolverCounterUnsat, 2164 mSDtfsCounter, 5641 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4249occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 1302 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2447 NumberOfCodeBlocks, 2447 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2433 ConstructedInterpolants, 0 QuantifiedInterpolants, 5169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1552/1552 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: 616]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 <= 7) && (a25 <= 0)) || (((a19 == 0) && (a11 <= 0)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a28 == 10)) && (a21 == 1)) && (a19 == 1))) || (((a25 == 1) && (a17 <= 7)) && (a28 <= 10))) || ((((a25 == 1) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1))) || ((((a19 == 0) && (a25 == 1)) && (a28 == 10)) && (a11 <= 0))) || (((a19 == 0) && (a11 <= 0)) && (a28 <= 7))) || (((a19 == 0) && (a11 == 1)) && (a28 <= 7))) || ((((((a17 == 8) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1)) && (a28 <= 7)) && (a25 <= 0))) || (((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) && (a25 <= 0))) || (((a25 == 1) && (a17 <= 7)) && (a11 <= 0))) || ((((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (((((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) || (((((a17 == 8) && (11 <= a28)) && (a25 == 1)) && (a21 == 1)) && (a19 == 1))) || (((((((a17 == 8) && (9 <= a28)) && (a11 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-08 10:28:27,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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