./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label03.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 952556ed09eb97342c813289f4f977504950938040f886fc499d9dbce543872a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 10:18:58,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 10:18:58,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 10:18:58,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 10:18:58,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 10:18:58,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 10:18:58,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 10:18:58,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 10:18:58,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 10:18:58,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 10:18:58,652 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 10:18:58,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 10:18:58,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 10:18:58,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 10:18:58,655 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 10:18:58,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 10:18:58,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 10:18:58,655 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 10:18:58,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 10:18:58,656 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 10:18:58,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 10:18:58,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 10:18:58,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 10:18:58,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 10:18:58,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 10:18:58,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 10:18:58,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 10:18:58,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 10:18:58,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 10:18:58,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 10:18:58,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 10:18:58,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 10:18:58,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:18:58,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 10:18:58,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 10:18:58,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 10:18:58,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 10:18:58,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 10:18:58,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 10:18:58,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 10:18:58,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 10:18:58,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 10:18:58,666 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 952556ed09eb97342c813289f4f977504950938040f886fc499d9dbce543872a [2024-11-18 10:18:58,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 10:18:58,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 10:18:58,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 10:18:58,971 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 10:18:58,972 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 10:18:58,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label03.c [2024-11-18 10:19:00,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 10:19:00,634 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 10:19:00,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c [2024-11-18 10:19:00,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c64e8f9e/ad5553b9dbb1415d8c0f5e99e790e6f8/FLAG0c55a733d [2024-11-18 10:19:00,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c64e8f9e/ad5553b9dbb1415d8c0f5e99e790e6f8 [2024-11-18 10:19:00,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 10:19:00,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 10:19:00,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 10:19:00,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 10:19:00,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 10:19:00,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:00" (1/1) ... [2024-11-18 10:19:00,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d65dc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:00, skipping insertion in model container [2024-11-18 10:19:00,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:19:00" (1/1) ... [2024-11-18 10:19:01,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 10:19:01,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c[4220,4233] [2024-11-18 10:19:01,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:19:01,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 10:19:01,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label03.c[4220,4233] [2024-11-18 10:19:01,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 10:19:01,555 INFO L204 MainTranslator]: Completed translation [2024-11-18 10:19:01,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01 WrapperNode [2024-11-18 10:19:01,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 10:19:01,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 10:19:01,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 10:19:01,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 10:19:01,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,639 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-18 10:19:01,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 10:19:01,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 10:19:01,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 10:19:01,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 10:19:01,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,695 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 10:19:01,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 10:19:01,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 10:19:01,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 10:19:01,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 10:19:01,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (1/1) ... [2024-11-18 10:19:01,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 10:19:01,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:19:01,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 10:19:01,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 10:19:01,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 10:19:01,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 10:19:01,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 10:19:01,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 10:19:01,912 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 10:19:01,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 10:19:02,996 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-18 10:19:02,996 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 10:19:03,020 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 10:19:03,020 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 10:19:03,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:03 BoogieIcfgContainer [2024-11-18 10:19:03,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 10:19:03,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 10:19:03,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 10:19:03,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 10:19:03,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:19:00" (1/3) ... [2024-11-18 10:19:03,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de9b89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:03, skipping insertion in model container [2024-11-18 10:19:03,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:19:01" (2/3) ... [2024-11-18 10:19:03,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de9b89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:19:03, skipping insertion in model container [2024-11-18 10:19:03,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:03" (3/3) ... [2024-11-18 10:19:03,031 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label03.c [2024-11-18 10:19:03,048 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 10:19:03,048 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 10:19:03,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 10:19:03,127 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;@7488faab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 10:19:03,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 10:19:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 10:19:03,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:03,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:03,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:03,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1318097310, now seen corresponding path program 1 times [2024-11-18 10:19:03,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:03,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079022309] [2024-11-18 10:19:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:03,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:03,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079022309] [2024-11-18 10:19:03,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079022309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:03,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:03,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:19:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541590152] [2024-11-18 10:19:03,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:03,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:03,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:03,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:03,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:03,579 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:04,452 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions. [2024-11-18 10:19:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:04,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2024-11-18 10:19:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:04,471 INFO L225 Difference]: With dead ends: 567 [2024-11-18 10:19:04,471 INFO L226 Difference]: Without dead ends: 282 [2024-11-18 10:19:04,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:04,478 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:04,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 32 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 10:19:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-18 10:19:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-18 10:19:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-18 10:19:04,530 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 36 [2024-11-18 10:19:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:04,531 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-18 10:19:04,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-18 10:19:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-18 10:19:04,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:04,534 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] [2024-11-18 10:19:04,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 10:19:04,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:04,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1859366958, now seen corresponding path program 1 times [2024-11-18 10:19:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299671678] [2024-11-18 10:19:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:04,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:04,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299671678] [2024-11-18 10:19:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299671678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:04,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766191452] [2024-11-18 10:19:04,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:04,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:04,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:04,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:04,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:04,765 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:05,236 INFO L93 Difference]: Finished difference Result 840 states and 1291 transitions. [2024-11-18 10:19:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:05,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-18 10:19:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:05,244 INFO L225 Difference]: With dead ends: 840 [2024-11-18 10:19:05,244 INFO L226 Difference]: Without dead ends: 560 [2024-11-18 10:19:05,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:05,247 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 106 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:05,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 226 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-18 10:19:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-18 10:19:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 559 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2024-11-18 10:19:05,286 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 102 [2024-11-18 10:19:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:05,287 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2024-11-18 10:19:05,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2024-11-18 10:19:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-18 10:19:05,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:05,293 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] [2024-11-18 10:19:05,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 10:19:05,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:05,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash 927047233, now seen corresponding path program 1 times [2024-11-18 10:19:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:05,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146052901] [2024-11-18 10:19:05,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:05,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:05,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146052901] [2024-11-18 10:19:05,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146052901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:05,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:05,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:19:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768286574] [2024-11-18 10:19:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:05,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:05,597 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:06,023 INFO L93 Difference]: Finished difference Result 1257 states and 1672 transitions. [2024-11-18 10:19:06,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:06,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-18 10:19:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:06,027 INFO L225 Difference]: With dead ends: 1257 [2024-11-18 10:19:06,027 INFO L226 Difference]: Without dead ends: 699 [2024-11-18 10:19:06,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:06,032 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:06,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-18 10:19:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-18 10:19:06,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2951289398280803) internal successors, (904), 698 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 904 transitions. [2024-11-18 10:19:06,058 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 904 transitions. Word has length 109 [2024-11-18 10:19:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:06,059 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 904 transitions. [2024-11-18 10:19:06,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 904 transitions. [2024-11-18 10:19:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 10:19:06,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:06,062 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, 1] [2024-11-18 10:19:06,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 10:19:06,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:06,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1430752311, now seen corresponding path program 1 times [2024-11-18 10:19:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075437046] [2024-11-18 10:19:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:06,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075437046] [2024-11-18 10:19:06,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075437046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:06,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:06,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 10:19:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100576915] [2024-11-18 10:19:06,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:06,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:06,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:06,206 INFO L87 Difference]: Start difference. First operand 699 states and 904 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:06,713 INFO L93 Difference]: Finished difference Result 1674 states and 2235 transitions. [2024-11-18 10:19:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:06,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-18 10:19:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:06,717 INFO L225 Difference]: With dead ends: 1674 [2024-11-18 10:19:06,717 INFO L226 Difference]: Without dead ends: 977 [2024-11-18 10:19:06,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:06,719 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:06,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-18 10:19:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2024-11-18 10:19:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2736389684813754) internal successors, (889), 698 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 889 transitions. [2024-11-18 10:19:06,735 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 889 transitions. Word has length 113 [2024-11-18 10:19:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:06,736 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 889 transitions. [2024-11-18 10:19:06,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 889 transitions. [2024-11-18 10:19:06,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-18 10:19:06,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:06,740 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] [2024-11-18 10:19:06,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 10:19:06,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:06,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1859670361, now seen corresponding path program 1 times [2024-11-18 10:19:06,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:06,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42838762] [2024-11-18 10:19:06,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:06,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42838762] [2024-11-18 10:19:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42838762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:07,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:07,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 10:19:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576008905] [2024-11-18 10:19:07,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:07,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 10:19:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 10:19:07,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:07,208 INFO L87 Difference]: Start difference. First operand 699 states and 889 transitions. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:07,746 INFO L93 Difference]: Finished difference Result 1312 states and 1682 transitions. [2024-11-18 10:19:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 10:19:07,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2024-11-18 10:19:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:07,749 INFO L225 Difference]: With dead ends: 1312 [2024-11-18 10:19:07,750 INFO L226 Difference]: Without dead ends: 699 [2024-11-18 10:19:07,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:07,752 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:07,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-18 10:19:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-18 10:19:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2679083094555874) internal successors, (885), 698 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:07,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 885 transitions. [2024-11-18 10:19:07,765 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 885 transitions. Word has length 184 [2024-11-18 10:19:07,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:07,766 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 885 transitions. [2024-11-18 10:19:07,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 885 transitions. [2024-11-18 10:19:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-18 10:19:07,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:07,769 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] [2024-11-18 10:19:07,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 10:19:07,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:07,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash 125528837, now seen corresponding path program 1 times [2024-11-18 10:19:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883636865] [2024-11-18 10:19:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-18 10:19:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883636865] [2024-11-18 10:19:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883636865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:08,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:08,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921804029] [2024-11-18 10:19:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:08,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 10:19:08,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:08,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 10:19:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 10:19:08,186 INFO L87 Difference]: Start difference. First operand 699 states and 885 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:08,722 INFO L93 Difference]: Finished difference Result 1257 states and 1620 transitions. [2024-11-18 10:19:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 10:19:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 196 [2024-11-18 10:19:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:08,728 INFO L225 Difference]: With dead ends: 1257 [2024-11-18 10:19:08,729 INFO L226 Difference]: Without dead ends: 699 [2024-11-18 10:19:08,731 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-11-18 10:19:08,731 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 127 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:08,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 87 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-18 10:19:08,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-18 10:19:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2607449856733524) internal successors, (880), 698 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 880 transitions. [2024-11-18 10:19:08,753 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 880 transitions. Word has length 196 [2024-11-18 10:19:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:08,757 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 880 transitions. [2024-11-18 10:19:08,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:08,758 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 880 transitions. [2024-11-18 10:19:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-18 10:19:08,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:08,760 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, 1] [2024-11-18 10:19:08,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 10:19:08,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:08,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2074233919, now seen corresponding path program 1 times [2024-11-18 10:19:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:08,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596259887] [2024-11-18 10:19:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:08,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-18 10:19:08,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596259887] [2024-11-18 10:19:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596259887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:08,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44201951] [2024-11-18 10:19:08,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:08,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:08,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:08,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:08,959 INFO L87 Difference]: Start difference. First operand 699 states and 880 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-11-18 10:19:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:09,455 INFO L93 Difference]: Finished difference Result 1535 states and 2042 transitions. [2024-11-18 10:19:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:09,456 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 220 [2024-11-18 10:19:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:09,460 INFO L225 Difference]: With dead ends: 1535 [2024-11-18 10:19:09,460 INFO L226 Difference]: Without dead ends: 977 [2024-11-18 10:19:09,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:09,464 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 106 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:09,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 225 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-18 10:19:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2024-11-18 10:19:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2353643966547192) internal successors, (1034), 837 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1034 transitions. [2024-11-18 10:19:09,482 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1034 transitions. Word has length 220 [2024-11-18 10:19:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:09,482 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1034 transitions. [2024-11-18 10:19:09,482 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-11-18 10:19:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1034 transitions. [2024-11-18 10:19:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-18 10:19:09,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:09,485 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, 1] [2024-11-18 10:19:09,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 10:19:09,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:09,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1399677776, now seen corresponding path program 1 times [2024-11-18 10:19:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:09,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531623753] [2024-11-18 10:19:09,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:09,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:09,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:09,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531623753] [2024-11-18 10:19:09,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531623753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:09,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579809396] [2024-11-18 10:19:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:09,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:09,735 INFO L87 Difference]: Start difference. First operand 838 states and 1034 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:10,200 INFO L93 Difference]: Finished difference Result 1813 states and 2350 transitions. [2024-11-18 10:19:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:10,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-18 10:19:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:10,205 INFO L225 Difference]: With dead ends: 1813 [2024-11-18 10:19:10,205 INFO L226 Difference]: Without dead ends: 1116 [2024-11-18 10:19:10,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:10,208 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:10,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 189 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-18 10:19:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2024-11-18 10:19:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.240358744394619) internal successors, (1383), 1115 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:10,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1383 transitions. [2024-11-18 10:19:10,237 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1383 transitions. Word has length 225 [2024-11-18 10:19:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:10,238 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1383 transitions. [2024-11-18 10:19:10,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1383 transitions. [2024-11-18 10:19:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-18 10:19:10,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:10,241 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, 1] [2024-11-18 10:19:10,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 10:19:10,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash 327038120, now seen corresponding path program 1 times [2024-11-18 10:19:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:10,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215996935] [2024-11-18 10:19:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-18 10:19:10,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:10,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215996935] [2024-11-18 10:19:10,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215996935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:10,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:10,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:10,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559428481] [2024-11-18 10:19:10,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:10,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:10,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:10,450 INFO L87 Difference]: Start difference. First operand 1116 states and 1383 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-11-18 10:19:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:10,930 INFO L93 Difference]: Finished difference Result 2091 states and 2621 transitions. [2024-11-18 10:19:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:10,933 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 230 [2024-11-18 10:19:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:10,937 INFO L225 Difference]: With dead ends: 2091 [2024-11-18 10:19:10,937 INFO L226 Difference]: Without dead ends: 1116 [2024-11-18 10:19:10,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:10,939 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:10,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 215 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:10,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-18 10:19:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2024-11-18 10:19:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.1372950819672132) internal successors, (1110), 976 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1110 transitions. [2024-11-18 10:19:10,957 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1110 transitions. Word has length 230 [2024-11-18 10:19:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:10,958 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1110 transitions. [2024-11-18 10:19:10,958 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-11-18 10:19:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1110 transitions. [2024-11-18 10:19:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-18 10:19:10,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:10,961 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, 1] [2024-11-18 10:19:10,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 10:19:10,961 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:10,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:10,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1141183502, now seen corresponding path program 1 times [2024-11-18 10:19:10,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:10,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715973196] [2024-11-18 10:19:10,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:10,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 10:19:11,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715973196] [2024-11-18 10:19:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715973196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 10:19:11,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631004537] [2024-11-18 10:19:11,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:11,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 10:19:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 10:19:11,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 10:19:11,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 10:19:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:11,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 10:19:11,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 10:19:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-18 10:19:11,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 10:19:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631004537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 10:19:11,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-18 10:19:11,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300052059] [2024-11-18 10:19:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 10:19:11,788 INFO L87 Difference]: Start difference. First operand 977 states and 1110 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 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-11-18 10:19:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:12,288 INFO L93 Difference]: Finished difference Result 2230 states and 2582 transitions. [2024-11-18 10:19:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:12,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 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 237 [2024-11-18 10:19:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:12,294 INFO L225 Difference]: With dead ends: 2230 [2024-11-18 10:19:12,294 INFO L226 Difference]: Without dead ends: 1394 [2024-11-18 10:19:12,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 236 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-11-18 10:19:12,296 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:12,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 10:19:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-18 10:19:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2024-11-18 10:19:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.1249102656137833) internal successors, (1567), 1393 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1567 transitions. [2024-11-18 10:19:12,327 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1567 transitions. Word has length 237 [2024-11-18 10:19:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:12,328 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1567 transitions. [2024-11-18 10:19:12,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 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-11-18 10:19:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1567 transitions. [2024-11-18 10:19:12,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-18 10:19:12,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:12,332 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, 1] [2024-11-18 10:19:12,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 10:19:12,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-18 10:19:12,534 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:12,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash 570805342, now seen corresponding path program 1 times [2024-11-18 10:19:12,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:12,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891252572] [2024-11-18 10:19:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-11-18 10:19:12,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:12,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891252572] [2024-11-18 10:19:12,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891252572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:12,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:12,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:12,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949191365] [2024-11-18 10:19:12,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:12,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:12,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:12,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:12,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:12,721 INFO L87 Difference]: Start difference. First operand 1394 states and 1567 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-11-18 10:19:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:13,159 INFO L93 Difference]: Finished difference Result 2647 states and 2989 transitions. [2024-11-18 10:19:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:13,160 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 245 [2024-11-18 10:19:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:13,165 INFO L225 Difference]: With dead ends: 2647 [2024-11-18 10:19:13,165 INFO L226 Difference]: Without dead ends: 1394 [2024-11-18 10:19:13,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:13,168 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 112 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:13,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 200 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-18 10:19:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1255. [2024-11-18 10:19:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.0909090909090908) internal successors, (1368), 1254 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:13,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1368 transitions. [2024-11-18 10:19:13,190 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1368 transitions. Word has length 245 [2024-11-18 10:19:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:13,191 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1368 transitions. [2024-11-18 10:19:13,191 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-11-18 10:19:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1368 transitions. [2024-11-18 10:19:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-18 10:19:13,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 10:19:13,196 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, 1] [2024-11-18 10:19:13,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 10:19:13,196 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 10:19:13,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 10:19:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash -191746922, now seen corresponding path program 1 times [2024-11-18 10:19:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 10:19:13,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141831707] [2024-11-18 10:19:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 10:19:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 10:19:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 10:19:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-11-18 10:19:13,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 10:19:13,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141831707] [2024-11-18 10:19:13,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141831707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 10:19:13,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 10:19:13,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 10:19:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130257660] [2024-11-18 10:19:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 10:19:13,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 10:19:13,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 10:19:13,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 10:19:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:13,408 INFO L87 Difference]: Start difference. First operand 1255 states and 1368 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 10:19:13,842 INFO L93 Difference]: Finished difference Result 1672 states and 1824 transitions. [2024-11-18 10:19:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 10:19:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 308 [2024-11-18 10:19:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 10:19:13,843 INFO L225 Difference]: With dead ends: 1672 [2024-11-18 10:19:13,843 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 10:19:13,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 10:19:13,845 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 148 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 10:19:13,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 8 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 10:19:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 10:19:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 10:19:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 10:19:13,847 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 308 [2024-11-18 10:19:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 10:19:13,847 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 10:19:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 10:19:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 10:19:13,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 10:19:13,850 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 10:19:13,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 10:19:13,854 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 10:19:13,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 10:19:14,012 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 10:19:14,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:19:14 BoogieIcfgContainer [2024-11-18 10:19:14,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 10:19:14,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 10:19:14,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 10:19:14,032 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 10:19:14,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:19:03" (3/4) ... [2024-11-18 10:19:14,042 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 10:19:14,062 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-18 10:19:14,063 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 10:19:14,064 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 10:19:14,068 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 10:19:14,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 10:19:14,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 10:19:14,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 10:19:14,224 INFO L158 Benchmark]: Toolchain (without parser) took 13257.50ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 136.0MB in the beginning and 157.2MB in the end (delta: -21.2MB). Peak memory consumption was 123.1MB. Max. memory is 16.1GB. [2024-11-18 10:19:14,225 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 10:19:14,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.24ms. Allocated memory is still 192.9MB. Free memory was 135.5MB in the beginning and 155.4MB in the end (delta: -19.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-18 10:19:14,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.43ms. Allocated memory is still 192.9MB. Free memory was 154.5MB in the beginning and 147.0MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 10:19:14,225 INFO L158 Benchmark]: Boogie Preprocessor took 124.53ms. Allocated memory is still 192.9MB. Free memory was 147.0MB in the beginning and 136.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 10:19:14,225 INFO L158 Benchmark]: RCFGBuilder took 1255.42ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 136.5MB in the beginning and 156.1MB in the end (delta: -19.6MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2024-11-18 10:19:14,226 INFO L158 Benchmark]: TraceAbstraction took 11007.69ms. Allocated memory was 232.8MB in the beginning and 337.6MB in the end (delta: 104.9MB). Free memory was 155.0MB in the beginning and 168.7MB in the end (delta: -13.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2024-11-18 10:19:14,226 INFO L158 Benchmark]: Witness Printer took 191.76ms. Allocated memory is still 337.6MB. Free memory was 168.7MB in the beginning and 157.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 10:19:14,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.24ms. Allocated memory is still 192.9MB. Free memory was 135.5MB in the beginning and 155.4MB in the end (delta: -19.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.43ms. Allocated memory is still 192.9MB. Free memory was 154.5MB in the beginning and 147.0MB in the end (delta: 7.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.53ms. Allocated memory is still 192.9MB. Free memory was 147.0MB in the beginning and 136.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1255.42ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 136.5MB in the beginning and 156.1MB in the end (delta: -19.6MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11007.69ms. Allocated memory was 232.8MB in the beginning and 337.6MB in the end (delta: 104.9MB). Free memory was 155.0MB in the beginning and 168.7MB in the end (delta: -13.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 191.76ms. Allocated memory is still 337.6MB. Free memory was 168.7MB in the beginning and 157.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1292 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1292 mSDsluCounter, 1371 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 652 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4978 IncrementalHoareTripleChecker+Invalid, 5630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 652 mSolverCounterUnsat, 1301 mSDtfsCounter, 4978 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1394occurred in iteration=10, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 695 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2442 NumberOfCodeBlocks, 2442 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2429 ConstructedInterpolants, 0 QuantifiedInterpolants, 7618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 337 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 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)) || (((((a19 <= 9) && (7 <= a19)) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || ((((7 <= a19) && (a10 == 1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-18 10:19:14,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE