./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 952556ed09eb97342c813289f4f977504950938040f886fc499d9dbce543872a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:15:38,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:15:38,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:15:38,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:15:38,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:15:38,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:15:38,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:15:38,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:15:38,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:15:38,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:15:38,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:15:38,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:15:38,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:15:38,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:15:38,707 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:15:38,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:15:38,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:15:38,707 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:15:38,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:15:38,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:15:38,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:15:38,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:15:38,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:15:38,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:15:38,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:15:38,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:15:38,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:15:38,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:15:38,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:15:38,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:15:38,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:15:38,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:15:38,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:15:38,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:15:38,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:15:38,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:15:38,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:15:38,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:15:38,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:15:38,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:15:38,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:15:38,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:15:38,716 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 952556ed09eb97342c813289f4f977504950938040f886fc499d9dbce543872a [2024-10-10 23:15:38,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:15:38,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:15:38,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:15:38,955 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:15:38,955 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:15:38,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c [2024-10-10 23:15:40,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:15:40,387 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:15:40,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c [2024-10-10 23:15:40,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/116e31fb3/589cc8789c2e4e28aacca7da62185822/FLAG16014f54f [2024-10-10 23:15:40,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/116e31fb3/589cc8789c2e4e28aacca7da62185822 [2024-10-10 23:15:40,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:15:40,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:15:40,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:15:40,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:15:40,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:15:40,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:15:40" (1/1) ... [2024-10-10 23:15:40,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d575b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:40, skipping insertion in model container [2024-10-10 23:15:40,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:15:40" (1/1) ... [2024-10-10 23:15:40,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:15:40,957 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c[4220,4233] [2024-10-10 23:15:41,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:15:41,096 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:15:41,116 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c[4220,4233] [2024-10-10 23:15:41,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:15:41,184 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:15:41,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41 WrapperNode [2024-10-10 23:15:41,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:15:41,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:15:41,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:15:41,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:15:41,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,247 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:15:41,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:15:41,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:15:41,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:15:41,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:15:41,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,281 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:15:41,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:15:41,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:15:41,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:15:41,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:15:41,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (1/1) ... [2024-10-10 23:15:41,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:15:41,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:15:41,341 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:15:41,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:15:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:15:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:15:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:15:41,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:15:41,441 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:15:41,443 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:15:42,240 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:15:42,240 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:15:42,302 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:15:42,302 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:15:42,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:42 BoogieIcfgContainer [2024-10-10 23:15:42,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:15:42,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:15:42,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:15:42,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:15:42,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:15:40" (1/3) ... [2024-10-10 23:15:42,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a14ae2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:15:42, skipping insertion in model container [2024-10-10 23:15:42,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:15:41" (2/3) ... [2024-10-10 23:15:42,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a14ae2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:15:42, skipping insertion in model container [2024-10-10 23:15:42,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:42" (3/3) ... [2024-10-10 23:15:42,309 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label03.c [2024-10-10 23:15:42,321 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:15:42,322 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:15:42,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:15:42,374 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;@5080aeb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:15:42,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:15:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 23:15:42,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:42,384 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] [2024-10-10 23:15:42,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:42,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:42,390 INFO L85 PathProgramCache]: Analyzing trace with hash -84182637, now seen corresponding path program 1 times [2024-10-10 23:15:42,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:42,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753464723] [2024-10-10 23:15:42,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:42,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:42,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753464723] [2024-10-10 23:15:42,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753464723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:42,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:42,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:42,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502585740] [2024-10-10 23:15:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:42,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:15:42,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:42,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:15:42,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:15:42,584 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:42,619 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:15:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:15:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-10 23:15:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:42,630 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:15:42,631 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:15:42,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:15:42,637 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:42,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:15:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:15:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:15:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:15:42,675 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 35 [2024-10-10 23:15:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:42,676 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:15:42,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:15:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 23:15:42,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:42,677 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] [2024-10-10 23:15:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:15:42,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 482323373, now seen corresponding path program 1 times [2024-10-10 23:15:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596561892] [2024-10-10 23:15:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:42,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:42,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596561892] [2024-10-10 23:15:42,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596561892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:42,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:42,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:42,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367943110] [2024-10-10 23:15:42,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:42,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:42,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:42,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:42,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:42,822 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:43,305 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2024-10-10 23:15:43,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:43,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-10 23:15:43,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:43,307 INFO L225 Difference]: With dead ends: 283 [2024-10-10 23:15:43,307 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:15:43,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:43,308 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 116 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:43,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 9 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:15:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:15:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:15:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2024-10-10 23:15:43,332 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 35 [2024-10-10 23:15:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:43,333 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2024-10-10 23:15:43,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2024-10-10 23:15:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-10 23:15:43,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:43,337 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:43,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:15:43,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:43,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:43,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1112534713, now seen corresponding path program 1 times [2024-10-10 23:15:43,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:43,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433542684] [2024-10-10 23:15:43,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:43,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:43,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:43,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433542684] [2024-10-10 23:15:43,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433542684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:43,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:43,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:43,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381241102] [2024-10-10 23:15:43,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:43,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:43,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:43,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:43,539 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:43,955 INFO L93 Difference]: Finished difference Result 839 states and 1290 transitions. [2024-10-10 23:15:43,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:43,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-10 23:15:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:43,960 INFO L225 Difference]: With dead ends: 839 [2024-10-10 23:15:43,960 INFO L226 Difference]: Without dead ends: 559 [2024-10-10 23:15:43,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:43,962 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 106 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:43,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 223 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-10 23:15:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-10 23:15:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3064516129032258) internal successors, (729), 558 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2024-10-10 23:15:43,983 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 101 [2024-10-10 23:15:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:43,984 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2024-10-10 23:15:43,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2024-10-10 23:15:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-10 23:15:43,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:43,987 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-10 23:15:43,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:15:43,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:43,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1335427754, now seen corresponding path program 1 times [2024-10-10 23:15:43,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:43,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046552249] [2024-10-10 23:15:43,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:44,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:44,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046552249] [2024-10-10 23:15:44,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046552249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:44,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:44,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639119649] [2024-10-10 23:15:44,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:44,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:44,224 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:44,613 INFO L93 Difference]: Finished difference Result 1256 states and 1671 transitions. [2024-10-10 23:15:44,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-10-10 23:15:44,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:44,616 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:15:44,616 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:15:44,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:44,622 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:44,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 50 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:15:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:15:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2955523672883789) internal successors, (903), 697 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 903 transitions. [2024-10-10 23:15:44,644 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 903 transitions. Word has length 108 [2024-10-10 23:15:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:44,644 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 903 transitions. [2024-10-10 23:15:44,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 903 transitions. [2024-10-10 23:15:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-10 23:15:44,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:44,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:44,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:15:44,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:44,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash -271755060, now seen corresponding path program 1 times [2024-10-10 23:15:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317649788] [2024-10-10 23:15:44,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:44,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317649788] [2024-10-10 23:15:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317649788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:15:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985684674] [2024-10-10 23:15:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:44,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:44,837 INFO L87 Difference]: Start difference. First operand 698 states and 903 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:45,235 INFO L93 Difference]: Finished difference Result 1673 states and 2234 transitions. [2024-10-10 23:15:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:45,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-10-10 23:15:45,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:45,240 INFO L225 Difference]: With dead ends: 1673 [2024-10-10 23:15:45,240 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:15:45,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:45,242 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:45,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 75 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:15:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 698. [2024-10-10 23:15:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2740315638450501) internal successors, (888), 697 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 888 transitions. [2024-10-10 23:15:45,262 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 888 transitions. Word has length 112 [2024-10-10 23:15:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:45,263 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 888 transitions. [2024-10-10 23:15:45,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 888 transitions. [2024-10-10 23:15:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-10 23:15:45,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:45,269 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:15:45,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:15:45,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:45,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 211789938, now seen corresponding path program 1 times [2024-10-10 23:15:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25862674] [2024-10-10 23:15:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25862674] [2024-10-10 23:15:45,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25862674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:45,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:15:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330068859] [2024-10-10 23:15:45,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:45,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:15:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:45,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:15:45,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:45,638 INFO L87 Difference]: Start difference. First operand 698 states and 888 transitions. Second operand has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 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-10-10 23:15:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:46,068 INFO L93 Difference]: Finished difference Result 1311 states and 1681 transitions. [2024-10-10 23:15:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:15:46,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 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 183 [2024-10-10 23:15:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:46,073 INFO L225 Difference]: With dead ends: 1311 [2024-10-10 23:15:46,073 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:15:46,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:46,076 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:46,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 21 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:15:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:15:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2682926829268293) internal successors, (884), 697 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 884 transitions. [2024-10-10 23:15:46,091 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 884 transitions. Word has length 183 [2024-10-10 23:15:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:46,091 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 884 transitions. [2024-10-10 23:15:46,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 6 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-10-10 23:15:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 884 transitions. [2024-10-10 23:15:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-10 23:15:46,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:46,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:46,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:15:46,093 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:46,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:46,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1683223472, now seen corresponding path program 1 times [2024-10-10 23:15:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:46,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388081999] [2024-10-10 23:15:46,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 23:15:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:46,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388081999] [2024-10-10 23:15:46,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388081999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:46,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:46,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380834728] [2024-10-10 23:15:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:46,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:15:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:15:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:15:46,389 INFO L87 Difference]: Start difference. First operand 698 states and 884 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:46,820 INFO L93 Difference]: Finished difference Result 1256 states and 1619 transitions. [2024-10-10 23:15:46,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:15:46,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2024-10-10 23:15:46,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:46,823 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:15:46,823 INFO L226 Difference]: Without dead ends: 698 [2024-10-10 23:15:46,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:15:46,825 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:46,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 83 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:15:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-10 23:15:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-10 23:15:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2611190817790532) internal successors, (879), 697 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 879 transitions. [2024-10-10 23:15:46,836 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 879 transitions. Word has length 195 [2024-10-10 23:15:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:46,836 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 879 transitions. [2024-10-10 23:15:46,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 879 transitions. [2024-10-10 23:15:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-10 23:15:46,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:46,838 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:15:46,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:15:46,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:46,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:46,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1558060020, now seen corresponding path program 1 times [2024-10-10 23:15:46,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:46,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646431769] [2024-10-10 23:15:46,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:46,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:46,962 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-10-10 23:15:46,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:46,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646431769] [2024-10-10 23:15:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646431769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:46,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:46,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450533820] [2024-10-10 23:15:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:46,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:46,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:46,964 INFO L87 Difference]: Start difference. First operand 698 states and 879 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:47,329 INFO L93 Difference]: Finished difference Result 1534 states and 2041 transitions. [2024-10-10 23:15:47,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:47,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2024-10-10 23:15:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:47,332 INFO L225 Difference]: With dead ends: 1534 [2024-10-10 23:15:47,332 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:15:47,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:47,334 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 106 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:47,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 222 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:15:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 837. [2024-10-10 23:15:47,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.235645933014354) internal successors, (1033), 836 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1033 transitions. [2024-10-10 23:15:47,345 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1033 transitions. Word has length 219 [2024-10-10 23:15:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:47,345 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1033 transitions. [2024-10-10 23:15:47,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1033 transitions. [2024-10-10 23:15:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-10 23:15:47,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:47,347 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:47,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:15:47,347 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:47,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:47,348 INFO L85 PathProgramCache]: Analyzing trace with hash 935504357, now seen corresponding path program 1 times [2024-10-10 23:15:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49534649] [2024-10-10 23:15:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:47,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:47,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49534649] [2024-10-10 23:15:47,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49534649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:47,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:47,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705915815] [2024-10-10 23:15:47,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:47,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:47,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:47,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:47,469 INFO L87 Difference]: Start difference. First operand 837 states and 1033 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:47,818 INFO L93 Difference]: Finished difference Result 1812 states and 2349 transitions. [2024-10-10 23:15:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:47,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2024-10-10 23:15:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:47,822 INFO L225 Difference]: With dead ends: 1812 [2024-10-10 23:15:47,822 INFO L226 Difference]: Without dead ends: 1115 [2024-10-10 23:15:47,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:47,824 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:47,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 186 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-10 23:15:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-10 23:15:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2405745062836624) internal successors, (1382), 1114 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1382 transitions. [2024-10-10 23:15:47,839 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1382 transitions. Word has length 224 [2024-10-10 23:15:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:47,840 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1382 transitions. [2024-10-10 23:15:47,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1382 transitions. [2024-10-10 23:15:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-10 23:15:47,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:47,842 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:15:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:15:47,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:47,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash 231129907, now seen corresponding path program 1 times [2024-10-10 23:15:47,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35255525] [2024-10-10 23:15:47,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 23:15:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:47,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35255525] [2024-10-10 23:15:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35255525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:47,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:47,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357852814] [2024-10-10 23:15:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:47,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:47,984 INFO L87 Difference]: Start difference. First operand 1115 states and 1382 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:48,333 INFO L93 Difference]: Finished difference Result 2090 states and 2620 transitions. [2024-10-10 23:15:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:48,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-10-10 23:15:48,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:48,336 INFO L225 Difference]: With dead ends: 2090 [2024-10-10 23:15:48,336 INFO L226 Difference]: Without dead ends: 1115 [2024-10-10 23:15:48,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:48,338 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:48,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 212 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:48,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-10 23:15:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 976. [2024-10-10 23:15:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.1374358974358973) internal successors, (1109), 975 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1109 transitions. [2024-10-10 23:15:48,351 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1109 transitions. Word has length 229 [2024-10-10 23:15:48,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:48,352 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1109 transitions. [2024-10-10 23:15:48,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1109 transitions. [2024-10-10 23:15:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-10 23:15:48,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:48,354 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:48,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:15:48,354 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:48,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:48,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1859779335, now seen corresponding path program 1 times [2024-10-10 23:15:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:48,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695907992] [2024-10-10 23:15:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:15:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:48,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695907992] [2024-10-10 23:15:48,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695907992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:15:48,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911116172] [2024-10-10 23:15:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:48,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:15:48,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:15:48,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:15:48,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:15:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:48,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:15:48,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:15:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-10 23:15:49,022 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:15:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911116172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:15:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 23:15:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201541710] [2024-10-10 23:15:49,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:49,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:49,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:49,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:49,024 INFO L87 Difference]: Start difference. First operand 976 states and 1109 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:49,367 INFO L93 Difference]: Finished difference Result 2229 states and 2581 transitions. [2024-10-10 23:15:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:49,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2024-10-10 23:15:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:49,371 INFO L225 Difference]: With dead ends: 2229 [2024-10-10 23:15:49,372 INFO L226 Difference]: Without dead ends: 1393 [2024-10-10 23:15:49,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:15:49,373 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:49,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 33 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-10 23:15:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2024-10-10 23:15:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.125) internal successors, (1566), 1392 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1566 transitions. [2024-10-10 23:15:49,393 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1566 transitions. Word has length 236 [2024-10-10 23:15:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:49,393 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1566 transitions. [2024-10-10 23:15:49,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1566 transitions. [2024-10-10 23:15:49,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-10 23:15:49,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:49,396 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:49,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:15:49,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 23:15:49,597 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:49,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1308428685, now seen corresponding path program 1 times [2024-10-10 23:15:49,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:49,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642448161] [2024-10-10 23:15:49,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:49,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-10 23:15:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642448161] [2024-10-10 23:15:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642448161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:49,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824618053] [2024-10-10 23:15:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:49,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:49,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:49,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:49,720 INFO L87 Difference]: Start difference. First operand 1393 states and 1566 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:50,073 INFO L93 Difference]: Finished difference Result 2646 states and 2988 transitions. [2024-10-10 23:15:50,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:50,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2024-10-10 23:15:50,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:50,078 INFO L225 Difference]: With dead ends: 2646 [2024-10-10 23:15:50,078 INFO L226 Difference]: Without dead ends: 1393 [2024-10-10 23:15:50,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:50,080 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 112 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:50,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 197 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:50,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-10 23:15:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2024-10-10 23:15:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.0909816440542697) internal successors, (1367), 1253 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1367 transitions. [2024-10-10 23:15:50,097 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1367 transitions. Word has length 244 [2024-10-10 23:15:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:50,097 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1367 transitions. [2024-10-10 23:15:50,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1367 transitions. [2024-10-10 23:15:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-10 23:15:50,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:15:50,101 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:50,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:15:50,102 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:15:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:15:50,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1584589855, now seen corresponding path program 1 times [2024-10-10 23:15:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:15:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944018017] [2024-10-10 23:15:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:15:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:15:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:15:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-10-10 23:15:50,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:15:50,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944018017] [2024-10-10 23:15:50,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944018017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:15:50,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:15:50,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:15:50,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692690516] [2024-10-10 23:15:50,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:15:50,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:15:50,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:15:50,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:15:50,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:50,233 INFO L87 Difference]: Start difference. First operand 1254 states and 1367 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:15:50,556 INFO L93 Difference]: Finished difference Result 1671 states and 1823 transitions. [2024-10-10 23:15:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:15:50,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 307 [2024-10-10 23:15:50,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:15:50,557 INFO L225 Difference]: With dead ends: 1671 [2024-10-10 23:15:50,557 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:15:50,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:15:50,559 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 147 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:15:50,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 6 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:15:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:15:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:15:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:15:50,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2024-10-10 23:15:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:15:50,561 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:15:50,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:15:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:15:50,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:15:50,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:15:50,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:15:50,566 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:15:50,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:15:50,682 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:15:50,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:15:50 BoogieIcfgContainer [2024-10-10 23:15:50,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:15:50,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:15:50,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:15:50,695 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:15:50,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:15:42" (3/4) ... [2024-10-10 23:15:50,696 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:15:50,706 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:15:50,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:15:50,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:15:50,708 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:15:50,818 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:15:50,818 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:15:50,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:15:50,819 INFO L158 Benchmark]: Toolchain (without parser) took 10078.23ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 82.6MB in the beginning and 208.8MB in the end (delta: -126.1MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2024-10-10 23:15:50,819 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:15:50,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.71ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 82.5MB in the beginning and 157.5MB in the end (delta: -75.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-10-10 23:15:50,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.31ms. Allocated memory is still 201.3MB. Free memory was 157.5MB in the beginning and 150.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 23:15:50,820 INFO L158 Benchmark]: Boogie Preprocessor took 66.54ms. Allocated memory is still 201.3MB. Free memory was 150.2MB in the beginning and 139.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:15:50,821 INFO L158 Benchmark]: RCFGBuilder took 986.64ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 148.9MB in the end (delta: -9.2MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-10-10 23:15:50,821 INFO L158 Benchmark]: TraceAbstraction took 8390.22ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 147.8MB in the beginning and 220.3MB in the end (delta: -72.5MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2024-10-10 23:15:50,822 INFO L158 Benchmark]: Witness Printer took 124.11ms. Allocated memory is still 310.4MB. Free memory was 220.3MB in the beginning and 208.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:15:50,823 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.13ms. Allocated memory is still 155.2MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.71ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 82.5MB in the beginning and 157.5MB in the end (delta: -75.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.31ms. Allocated memory is still 201.3MB. Free memory was 157.5MB in the beginning and 150.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.54ms. Allocated memory is still 201.3MB. Free memory was 150.2MB in the beginning and 139.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 986.64ms. Allocated memory is still 201.3MB. Free memory was 139.7MB in the beginning and 148.9MB in the end (delta: -9.2MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8390.22ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 147.8MB in the beginning and 220.3MB in the end (delta: -72.5MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * Witness Printer took 124.11ms. Allocated memory is still 310.4MB. Free memory was 220.3MB in the beginning and 208.8MB in the end (delta: 11.5MB). 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: 122]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1243 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1243 mSDsluCounter, 1534 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 607 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4932 IncrementalHoareTripleChecker+Invalid, 5539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 607 mSolverCounterUnsat, 1476 mSDtfsCounter, 4932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1393occurred in iteration=11, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 695 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2464 NumberOfCodeBlocks, 2464 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2450 ConstructedInterpolants, 0 QuantifiedInterpolants, 7598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1534/1623 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: 592]: Loop Invariant Derived loop invariant: ((((((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || (((((a19 <= 9) && (7 <= a19)) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || ((((7 <= a19) && (a10 == 1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:15:50,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE