./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/heapsort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:20:46,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:20:46,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:20:46,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:20:46,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:20:46,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:20:46,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:20:46,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:20:46,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:20:46,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:20:46,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:20:46,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:20:46,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:20:46,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:20:46,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:20:46,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:20:46,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:20:46,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:20:46,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:20:46,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:20:46,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:20:46,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:20:46,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:20:46,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:20:46,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:20:46,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:20:46,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:20:46,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:20:46,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:20:46,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:20:46,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:20:46,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:20:46,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:20:46,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:20:46,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:20:46,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:20:46,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:20:46,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:20:46,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:20:46,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:20:46,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:20:46,590 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:20:46,623 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:20:46,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:20:46,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:20:46,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:20:46,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:20:46,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:20:46,626 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:20:46,626 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:20:46,626 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:20:46,626 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:20:46,627 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:20:46,627 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:20:46,627 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:20:46,627 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:20:46,628 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:20:46,628 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:20:46,628 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:20:46,628 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:20:46,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:20:46,629 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:20:46,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:20:46,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:20:46,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:20:46,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:20:46,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:20:46,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:20:46,631 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:20:46,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:20:46,632 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:20:46,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:20:46,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:20:46,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:20:46,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:20:46,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:20:46,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:20:46,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:20:46,633 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:20:46,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:20:46,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:20:46,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:20:46,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:20:46,635 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2021-11-21 01:20:46,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:20:46,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:20:46,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:20:46,935 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:20:46,936 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:20:46,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/loop-invgen/heapsort.i [2021-11-21 01:20:47,004 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/data/3000c1969/6131f72ddefb4bf88d8e35df147f9686/FLAG9eb30fc14 [2021-11-21 01:20:47,462 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:20:47,463 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/sv-benchmarks/c/loop-invgen/heapsort.i [2021-11-21 01:20:47,469 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/data/3000c1969/6131f72ddefb4bf88d8e35df147f9686/FLAG9eb30fc14 [2021-11-21 01:20:47,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/data/3000c1969/6131f72ddefb4bf88d8e35df147f9686 [2021-11-21 01:20:47,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:20:47,859 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:20:47,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:20:47,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:20:47,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:20:47,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:20:47" (1/1) ... [2021-11-21 01:20:47,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d379b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:47, skipping insertion in model container [2021-11-21 01:20:47,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:20:47" (1/1) ... [2021-11-21 01:20:47,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:20:47,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:20:48,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2021-11-21 01:20:48,074 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:20:48,092 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:20:48,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2021-11-21 01:20:48,127 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:20:48,140 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:20:48,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48 WrapperNode [2021-11-21 01:20:48,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:20:48,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:20:48,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:20:48,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:20:48,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,177 INFO L137 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2021-11-21 01:20:48,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:20:48,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:20:48,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:20:48,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:20:48,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:20:48,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:20:48,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:20:48,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:20:48,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (1/1) ... [2021-11-21 01:20:48,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:20:48,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:20:48,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:20:48,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:20:48,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:20:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:20:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:20:48,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:20:48,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-21 01:20:48,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-21 01:20:48,341 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:20:48,343 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:20:48,472 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:20:48,507 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:20:48,507 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-21 01:20:48,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:20:48 BoogieIcfgContainer [2021-11-21 01:20:48,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:20:48,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:20:48,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:20:48,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:20:48,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:20:47" (1/3) ... [2021-11-21 01:20:48,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b506120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:20:48, skipping insertion in model container [2021-11-21 01:20:48,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:20:48" (2/3) ... [2021-11-21 01:20:48,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b506120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:20:48, skipping insertion in model container [2021-11-21 01:20:48,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:20:48" (3/3) ... [2021-11-21 01:20:48,528 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2021-11-21 01:20:48,533 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:20:48,533 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 01:20:48,586 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:20:48,610 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:20:48,611 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 01:20:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-21 01:20:48,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-21 01:20:48,650 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:48,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:48,651 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:48,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1905704588, now seen corresponding path program 1 times [2021-11-21 01:20:48,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:48,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671609120] [2021-11-21 01:20:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:48,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:20:48,930 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671609120] [2021-11-21 01:20:48,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671609120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:48,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:48,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:20:48,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38349057] [2021-11-21 01:20:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:48,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 01:20:48,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 01:20:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:20:48,974 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:20:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:49,165 INFO L93 Difference]: Finished difference Result 93 states and 172 transitions. [2021-11-21 01:20:49,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:20:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-21 01:20:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:49,178 INFO L225 Difference]: With dead ends: 93 [2021-11-21 01:20:49,178 INFO L226 Difference]: Without dead ends: 57 [2021-11-21 01:20:49,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:20:49,188 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 20 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:49,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 176 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-21 01:20:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2021-11-21 01:20:49,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-21 01:20:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2021-11-21 01:20:49,248 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 9 [2021-11-21 01:20:49,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:49,248 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2021-11-21 01:20:49,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:20:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2021-11-21 01:20:49,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-21 01:20:49,250 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:49,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:49,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:20:49,251 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:49,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1900967819, now seen corresponding path program 1 times [2021-11-21 01:20:49,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:49,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871966016] [2021-11-21 01:20:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:49,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:20:49,360 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:49,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871966016] [2021-11-21 01:20:49,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871966016] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:49,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:49,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:20:49,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705818802] [2021-11-21 01:20:49,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:49,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 01:20:49,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:49,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 01:20:49,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:20:49,369 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:20:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:49,478 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2021-11-21 01:20:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:20:49,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-21 01:20:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:49,480 INFO L225 Difference]: With dead ends: 43 [2021-11-21 01:20:49,481 INFO L226 Difference]: Without dead ends: 41 [2021-11-21 01:20:49,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:20:49,483 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:49,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 122 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:49,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-11-21 01:20:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2021-11-21 01:20:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-21 01:20:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2021-11-21 01:20:49,507 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 9 [2021-11-21 01:20:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:49,508 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2021-11-21 01:20:49,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:20:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2021-11-21 01:20:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-21 01:20:49,510 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:49,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:49,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:20:49,511 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash -504724405, now seen corresponding path program 1 times [2021-11-21 01:20:49,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:49,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648533468] [2021-11-21 01:20:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:49,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:20:49,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:49,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648533468] [2021-11-21 01:20:49,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648533468] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:49,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:49,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-21 01:20:49,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809344586] [2021-11-21 01:20:49,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:49,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:20:49,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:20:49,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:20:49,702 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:20:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:49,944 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2021-11-21 01:20:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:20:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-21 01:20:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:49,946 INFO L225 Difference]: With dead ends: 72 [2021-11-21 01:20:49,947 INFO L226 Difference]: Without dead ends: 70 [2021-11-21 01:20:49,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:20:49,949 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:49,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 199 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:20:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-21 01:20:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2021-11-21 01:20:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-11-21 01:20:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2021-11-21 01:20:49,983 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 9 [2021-11-21 01:20:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:49,984 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2021-11-21 01:20:49,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:20:49,984 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2021-11-21 01:20:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 01:20:49,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:49,986 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:49,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 01:20:49,986 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:49,987 INFO L85 PathProgramCache]: Analyzing trace with hash -742689088, now seen corresponding path program 1 times [2021-11-21 01:20:49,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:49,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044157600] [2021-11-21 01:20:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:49,989 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:50,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:20:50,136 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:50,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044157600] [2021-11-21 01:20:50,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044157600] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:50,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:50,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-21 01:20:50,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171663739] [2021-11-21 01:20:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:50,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:20:50,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:20:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:20:50,140 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:20:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:50,376 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2021-11-21 01:20:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:20:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-21 01:20:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:50,384 INFO L225 Difference]: With dead ends: 71 [2021-11-21 01:20:50,384 INFO L226 Difference]: Without dead ends: 69 [2021-11-21 01:20:50,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-21 01:20:50,394 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 37 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:50,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 150 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:20:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-11-21 01:20:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-11-21 01:20:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-11-21 01:20:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 98 transitions. [2021-11-21 01:20:50,418 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 98 transitions. Word has length 14 [2021-11-21 01:20:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:50,418 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 98 transitions. [2021-11-21 01:20:50,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:20:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 98 transitions. [2021-11-21 01:20:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 01:20:50,420 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:50,420 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:50,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 01:20:50,420 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash -361326625, now seen corresponding path program 1 times [2021-11-21 01:20:50,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:50,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106519890] [2021-11-21 01:20:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:50,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:20:50,492 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:50,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106519890] [2021-11-21 01:20:50,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106519890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:50,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:50,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-21 01:20:50,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004184445] [2021-11-21 01:20:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:50,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 01:20:50,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:50,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 01:20:50,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:20:50,498 INFO L87 Difference]: Start difference. First operand 69 states and 98 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:20:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:50,589 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2021-11-21 01:20:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 01:20:50,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-21 01:20:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:50,595 INFO L225 Difference]: With dead ends: 75 [2021-11-21 01:20:50,595 INFO L226 Difference]: Without dead ends: 73 [2021-11-21 01:20:50,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:20:50,602 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 14 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:50,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 119 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-11-21 01:20:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-11-21 01:20:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-11-21 01:20:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2021-11-21 01:20:50,647 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 14 [2021-11-21 01:20:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:50,648 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-11-21 01:20:50,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:20:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2021-11-21 01:20:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 01:20:50,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:50,655 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:50,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 01:20:50,656 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1770883895, now seen corresponding path program 1 times [2021-11-21 01:20:50,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:50,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085190980] [2021-11-21 01:20:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:50,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:20:50,718 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:50,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085190980] [2021-11-21 01:20:50,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085190980] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:50,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:50,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-21 01:20:50,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713858296] [2021-11-21 01:20:50,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:50,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:20:50,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:50,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:20:50,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:20:50,721 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:20:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:50,845 INFO L93 Difference]: Finished difference Result 79 states and 106 transitions. [2021-11-21 01:20:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:20:50,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-21 01:20:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:50,847 INFO L225 Difference]: With dead ends: 79 [2021-11-21 01:20:50,847 INFO L226 Difference]: Without dead ends: 77 [2021-11-21 01:20:50,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:20:50,848 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 14 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:50,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 139 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-11-21 01:20:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-11-21 01:20:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 26 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2021-11-21 01:20:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2021-11-21 01:20:50,865 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 14 [2021-11-21 01:20:50,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:50,865 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2021-11-21 01:20:50,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:20:50,875 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2021-11-21 01:20:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 01:20:50,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:50,878 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:50,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-21 01:20:50,879 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1597699484, now seen corresponding path program 1 times [2021-11-21 01:20:50,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:50,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073661388] [2021-11-21 01:20:50,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:50,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:20:50,984 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:50,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073661388] [2021-11-21 01:20:50,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073661388] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:50,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:50,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-21 01:20:50,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660824532] [2021-11-21 01:20:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:50,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:20:50,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:50,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:20:50,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:20:50,987 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:20:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:51,169 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2021-11-21 01:20:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 01:20:51,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-11-21 01:20:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:51,175 INFO L225 Difference]: With dead ends: 118 [2021-11-21 01:20:51,175 INFO L226 Difference]: Without dead ends: 116 [2021-11-21 01:20:51,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-21 01:20:51,180 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:51,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 209 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-21 01:20:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2021-11-21 01:20:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2021-11-21 01:20:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2021-11-21 01:20:51,227 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 14 [2021-11-21 01:20:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:51,227 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2021-11-21 01:20:51,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 01:20:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2021-11-21 01:20:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-21 01:20:51,231 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:51,231 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:51,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-21 01:20:51,232 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:51,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:51,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1057383317, now seen corresponding path program 1 times [2021-11-21 01:20:51,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:51,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127541000] [2021-11-21 01:20:51,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:51,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:51,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 01:20:51,339 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:51,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127541000] [2021-11-21 01:20:51,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127541000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:51,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:51,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-21 01:20:51,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074616234] [2021-11-21 01:20:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:51,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:20:51,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:51,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:20:51,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:20:51,342 INFO L87 Difference]: Start difference. First operand 101 states and 140 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:20:51,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:51,491 INFO L93 Difference]: Finished difference Result 153 states and 225 transitions. [2021-11-21 01:20:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:20:51,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2021-11-21 01:20:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:51,498 INFO L225 Difference]: With dead ends: 153 [2021-11-21 01:20:51,499 INFO L226 Difference]: Without dead ends: 151 [2021-11-21 01:20:51,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:20:51,500 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 17 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:51,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 223 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-21 01:20:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 119. [2021-11-21 01:20:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 64 states have (on average 1.265625) internal successors, (81), 68 states have internal predecessors, (81), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2021-11-21 01:20:51,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2021-11-21 01:20:51,560 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 21 [2021-11-21 01:20:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:51,561 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2021-11-21 01:20:51,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:20:51,561 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2021-11-21 01:20:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-21 01:20:51,568 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:51,568 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:51,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-21 01:20:51,569 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1020128255, now seen corresponding path program 1 times [2021-11-21 01:20:51,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:51,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910878648] [2021-11-21 01:20:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:51,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:51,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-21 01:20:51,637 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:51,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910878648] [2021-11-21 01:20:51,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910878648] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:51,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:51,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-21 01:20:51,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677328482] [2021-11-21 01:20:51,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:51,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:20:51,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:51,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:20:51,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:20:51,640 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:20:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:51,781 INFO L93 Difference]: Finished difference Result 126 states and 175 transitions. [2021-11-21 01:20:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:20:51,782 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2021-11-21 01:20:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:51,783 INFO L225 Difference]: With dead ends: 126 [2021-11-21 01:20:51,783 INFO L226 Difference]: Without dead ends: 124 [2021-11-21 01:20:51,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:20:51,785 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:51,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-21 01:20:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2021-11-21 01:20:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.183673469387755) internal successors, (58), 51 states have internal predecessors, (58), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2021-11-21 01:20:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2021-11-21 01:20:51,800 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 23 [2021-11-21 01:20:51,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:51,800 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2021-11-21 01:20:51,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-21 01:20:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2021-11-21 01:20:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-21 01:20:51,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:51,802 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:51,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-21 01:20:51,803 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:51,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 970924607, now seen corresponding path program 1 times [2021-11-21 01:20:51,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:51,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068865054] [2021-11-21 01:20:51,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:51,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-21 01:20:51,866 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:51,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068865054] [2021-11-21 01:20:51,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068865054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:51,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:51,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-21 01:20:51,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394767316] [2021-11-21 01:20:51,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:51,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:20:51,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:51,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:20:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:20:51,869 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 01:20:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:52,052 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2021-11-21 01:20:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:20:52,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2021-11-21 01:20:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:52,056 INFO L225 Difference]: With dead ends: 98 [2021-11-21 01:20:52,056 INFO L226 Difference]: Without dead ends: 96 [2021-11-21 01:20:52,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:20:52,059 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:52,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 200 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-11-21 01:20:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2021-11-21 01:20:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 54 states have internal predecessors, (61), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2021-11-21 01:20:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2021-11-21 01:20:52,082 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 26 [2021-11-21 01:20:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:52,083 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2021-11-21 01:20:52,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-21 01:20:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2021-11-21 01:20:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-21 01:20:52,086 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:52,086 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:52,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-21 01:20:52,087 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 606224610, now seen corresponding path program 1 times [2021-11-21 01:20:52,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:52,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089674590] [2021-11-21 01:20:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:52,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-21 01:20:52,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:52,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089674590] [2021-11-21 01:20:52,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089674590] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:52,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:52,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-21 01:20:52,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723852181] [2021-11-21 01:20:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:52,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 01:20:52,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:52,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 01:20:52,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:20:52,216 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-21 01:20:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:52,368 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2021-11-21 01:20:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:20:52,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2021-11-21 01:20:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:52,370 INFO L225 Difference]: With dead ends: 101 [2021-11-21 01:20:52,370 INFO L226 Difference]: Without dead ends: 99 [2021-11-21 01:20:52,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-21 01:20:52,371 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 32 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:52,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 194 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-11-21 01:20:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2021-11-21 01:20:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 57 states have internal predecessors, (64), 23 states have call successors, (23), 12 states have call predecessors, (23), 12 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2021-11-21 01:20:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2021-11-21 01:20:52,386 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 35 [2021-11-21 01:20:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:52,387 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2021-11-21 01:20:52,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-21 01:20:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2021-11-21 01:20:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-21 01:20:52,389 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:52,389 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:52,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-21 01:20:52,389 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1230275415, now seen corresponding path program 1 times [2021-11-21 01:20:52,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:52,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479744600] [2021-11-21 01:20:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:52,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-21 01:20:52,465 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:52,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479744600] [2021-11-21 01:20:52,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479744600] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:52,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:52,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-21 01:20:52,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071315382] [2021-11-21 01:20:52,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:52,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:20:52,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:20:52,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:20:52,467 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-21 01:20:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:52,609 INFO L93 Difference]: Finished difference Result 163 states and 228 transitions. [2021-11-21 01:20:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:20:52,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2021-11-21 01:20:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:52,612 INFO L225 Difference]: With dead ends: 163 [2021-11-21 01:20:52,612 INFO L226 Difference]: Without dead ends: 161 [2021-11-21 01:20:52,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:20:52,613 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:52,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 265 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:52,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-21 01:20:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2021-11-21 01:20:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 84 states have internal predecessors, (97), 51 states have call successors, (51), 14 states have call predecessors, (51), 14 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2021-11-21 01:20:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 199 transitions. [2021-11-21 01:20:52,645 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 199 transitions. Word has length 42 [2021-11-21 01:20:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:52,648 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 199 transitions. [2021-11-21 01:20:52,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-21 01:20:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 199 transitions. [2021-11-21 01:20:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-21 01:20:52,652 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:52,652 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 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] [2021-11-21 01:20:52,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-21 01:20:52,653 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:52,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:52,654 INFO L85 PathProgramCache]: Analyzing trace with hash -653270493, now seen corresponding path program 1 times [2021-11-21 01:20:52,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:52,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350152492] [2021-11-21 01:20:52,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:52,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-21 01:20:52,755 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:52,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350152492] [2021-11-21 01:20:52,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350152492] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:52,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:20:52,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-21 01:20:52,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120001838] [2021-11-21 01:20:52,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:52,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-21 01:20:52,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:52,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-21 01:20:52,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:20:52,757 INFO L87 Difference]: Start difference. First operand 145 states and 199 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-21 01:20:52,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:52,932 INFO L93 Difference]: Finished difference Result 188 states and 269 transitions. [2021-11-21 01:20:52,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 01:20:52,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2021-11-21 01:20:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:52,935 INFO L225 Difference]: With dead ends: 188 [2021-11-21 01:20:52,935 INFO L226 Difference]: Without dead ends: 186 [2021-11-21 01:20:52,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:20:52,936 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:52,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 214 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-21 01:20:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 84. [2021-11-21 01:20:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 21 states have call successors, (21), 11 states have call predecessors, (21), 11 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2021-11-21 01:20:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2021-11-21 01:20:52,955 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 56 [2021-11-21 01:20:52,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:52,955 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2021-11-21 01:20:52,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-21 01:20:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2021-11-21 01:20:52,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-21 01:20:52,957 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:52,957 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:20:52,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-21 01:20:52,957 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1781169230, now seen corresponding path program 1 times [2021-11-21 01:20:52,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:52,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908377097] [2021-11-21 01:20:52,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:52,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-21 01:20:52,998 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:52,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908377097] [2021-11-21 01:20:52,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908377097] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:20:52,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062978617] [2021-11-21 01:20:52,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:52,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:20:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:20:53,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:20:53,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:20:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:53,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-21 01:20:53,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:20:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-11-21 01:20:53,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-21 01:20:53,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062978617] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:20:53,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-21 01:20:53,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2021-11-21 01:20:53,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007019877] [2021-11-21 01:20:53,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:20:53,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-21 01:20:53,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:20:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-21 01:20:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:20:53,393 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-21 01:20:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:20:53,505 INFO L93 Difference]: Finished difference Result 198 states and 254 transitions. [2021-11-21 01:20:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 01:20:53,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2021-11-21 01:20:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:20:53,508 INFO L225 Difference]: With dead ends: 198 [2021-11-21 01:20:53,508 INFO L226 Difference]: Without dead ends: 116 [2021-11-21 01:20:53,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-21 01:20:53,512 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-21 01:20:53,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-21 01:20:53,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-21 01:20:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2021-11-21 01:20:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 59 states have internal predecessors, (67), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2021-11-21 01:20:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2021-11-21 01:20:53,537 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 56 [2021-11-21 01:20:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:20:53,537 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2021-11-21 01:20:53,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-21 01:20:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2021-11-21 01:20:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-21 01:20:53,543 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:20:53,544 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 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] [2021-11-21 01:20:53,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-21 01:20:53,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:20:53,762 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:20:53,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:20:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 215528780, now seen corresponding path program 1 times [2021-11-21 01:20:53,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:20:53,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930770118] [2021-11-21 01:20:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:53,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:20:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2021-11-21 01:20:53,834 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:20:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930770118] [2021-11-21 01:20:53,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930770118] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:20:53,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574483138] [2021-11-21 01:20:53,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:20:53,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:20:53,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:20:53,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:20:53,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 01:20:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:20:53,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-21 01:20:53,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:20:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2021-11-21 01:20:54,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:20:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2021-11-21 01:20:54,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574483138] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:20:54,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1705533035] [2021-11-21 01:20:54,457 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2021-11-21 01:20:54,457 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:20:54,461 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:20:54,467 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:20:54,467 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:21:01,921 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2021-11-21 01:21:02,023 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 01:21:02,747 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-21 01:21:02,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:21:02,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2021-11-21 01:21:02,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161250234] [2021-11-21 01:21:02,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:21:02,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-21 01:21:02,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:21:02,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-21 01:21:02,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2021-11-21 01:21:02,750 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-21 01:21:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:02,983 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2021-11-21 01:21:02,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-21 01:21:02,984 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 77 [2021-11-21 01:21:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:02,986 INFO L225 Difference]: With dead ends: 120 [2021-11-21 01:21:02,986 INFO L226 Difference]: Without dead ends: 118 [2021-11-21 01:21:02,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2021-11-21 01:21:02,987 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:02,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 222 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:21:02,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-11-21 01:21:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2021-11-21 01:21:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 59 states have internal predecessors, (67), 27 states have call successors, (27), 12 states have call predecessors, (27), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2021-11-21 01:21:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2021-11-21 01:21:03,005 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 77 [2021-11-21 01:21:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:03,005 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2021-11-21 01:21:03,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 10 states have internal predecessors, (33), 3 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-21 01:21:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2021-11-21 01:21:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-21 01:21:03,011 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:03,012 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 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] [2021-11-21 01:21:03,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-21 01:21:03,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-21 01:21:03,230 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:21:03,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash 744962560, now seen corresponding path program 1 times [2021-11-21 01:21:03,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:21:03,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839068148] [2021-11-21 01:21:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:03,231 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:21:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2021-11-21 01:21:03,340 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:21:03,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839068148] [2021-11-21 01:21:03,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839068148] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:21:03,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693397435] [2021-11-21 01:21:03,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:03,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:21:03,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:21:03,347 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:21:03,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-21 01:21:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:03,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 01:21:03,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-11-21 01:21:03,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:21:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2021-11-21 01:21:03,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693397435] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:21:03,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1495011157] [2021-11-21 01:21:03,909 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2021-11-21 01:21:03,909 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:21:03,909 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:21:03,910 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:21:03,910 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:21:21,288 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 42 for LOIs [2021-11-21 01:21:21,330 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 01:21:22,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1495011157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:21:22,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:21:22,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 8, 8] total 23 [2021-11-21 01:21:22,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576475893] [2021-11-21 01:21:22,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:21:22,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 01:21:22,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:21:22,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 01:21:22,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-11-21 01:21:22,496 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-21 01:21:23,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:21:23,287 INFO L93 Difference]: Finished difference Result 311 states and 397 transitions. [2021-11-21 01:21:23,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-21 01:21:23,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2021-11-21 01:21:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:21:23,290 INFO L225 Difference]: With dead ends: 311 [2021-11-21 01:21:23,290 INFO L226 Difference]: Without dead ends: 215 [2021-11-21 01:21:23,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 261 SyntacticMatches, 19 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-11-21 01:21:23,293 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 68 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 01:21:23,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 81 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-21 01:21:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-21 01:21:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 183. [2021-11-21 01:21:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 109 states have (on average 1.146788990825688) internal successors, (125), 112 states have internal predecessors, (125), 50 states have call successors, (50), 23 states have call predecessors, (50), 23 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-21 01:21:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 225 transitions. [2021-11-21 01:21:23,334 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 225 transitions. Word has length 98 [2021-11-21 01:21:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:21:23,334 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 225 transitions. [2021-11-21 01:21:23,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-21 01:21:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 225 transitions. [2021-11-21 01:21:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-21 01:21:23,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:21:23,337 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:21:23,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-21 01:21:23,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:21:23,550 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:21:23,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:21:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1469390961, now seen corresponding path program 1 times [2021-11-21 01:21:23,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:21:23,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911764281] [2021-11-21 01:21:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:23,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:21:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2021-11-21 01:21:23,623 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:21:23,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911764281] [2021-11-21 01:21:23,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911764281] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:21:23,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63481317] [2021-11-21 01:21:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:21:23,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:21:23,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:21:23,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:21:23,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-21 01:21:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:21:23,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-21 01:21:23,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:21:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 314 proven. 1 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2021-11-21 01:21:23,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:21:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2021-11-21 01:21:24,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63481317] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:21:24,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1404632902] [2021-11-21 01:21:24,238 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2021-11-21 01:21:24,239 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:21:24,239 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:21:24,239 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:21:24,240 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:24:56,188 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 14 for LOIs [2021-11-21 01:24:56,384 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 01:24:57,558 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-21 01:24:57,558 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:24:57,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2021-11-21 01:24:57,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486635176] [2021-11-21 01:24:57,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-21 01:24:57,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-21 01:24:57,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:24:57,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-21 01:24:57,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2021-11-21 01:24:57,561 INFO L87 Difference]: Start difference. First operand 183 states and 225 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2021-11-21 01:24:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:58,558 INFO L93 Difference]: Finished difference Result 610 states and 868 transitions. [2021-11-21 01:24:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-21 01:24:58,560 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) Word has length 139 [2021-11-21 01:24:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:58,564 INFO L225 Difference]: With dead ends: 610 [2021-11-21 01:24:58,564 INFO L226 Difference]: Without dead ends: 431 [2021-11-21 01:24:58,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 397 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=267, Invalid=2283, Unknown=0, NotChecked=0, Total=2550 [2021-11-21 01:24:58,567 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 117 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:58,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 471 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-21 01:24:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-21 01:24:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 277. [2021-11-21 01:24:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 154 states have (on average 1.1948051948051948) internal successors, (184), 157 states have internal predecessors, (184), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2021-11-21 01:24:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 382 transitions. [2021-11-21 01:24:58,641 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 382 transitions. Word has length 139 [2021-11-21 01:24:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:58,641 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 382 transitions. [2021-11-21 01:24:58,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 5 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) [2021-11-21 01:24:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 382 transitions. [2021-11-21 01:24:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-11-21 01:24:58,645 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:24:58,645 INFO L514 BasicCegarLoop]: trace histogram [25, 24, 24, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:24:58,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-21 01:24:58,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-21 01:24:58,850 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 01:24:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:24:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1279674875, now seen corresponding path program 2 times [2021-11-21 01:24:58,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:24:58,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651889939] [2021-11-21 01:24:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:24:58,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:24:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:24:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1195 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2021-11-21 01:24:58,886 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:24:58,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651889939] [2021-11-21 01:24:58,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651889939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:24:58,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:24:58,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 01:24:58,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741119545] [2021-11-21 01:24:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:24:58,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:24:58,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:24:58,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:24:58,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:24:58,888 INFO L87 Difference]: Start difference. First operand 277 states and 382 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-21 01:24:58,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:24:58,944 INFO L93 Difference]: Finished difference Result 436 states and 603 transitions. [2021-11-21 01:24:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:24:58,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 153 [2021-11-21 01:24:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:24:58,946 INFO L225 Difference]: With dead ends: 436 [2021-11-21 01:24:58,946 INFO L226 Difference]: Without dead ends: 0 [2021-11-21 01:24:58,947 INFO L932 BasicCegarLoop]: 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 [2021-11-21 01:24:58,948 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:24:58,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:24:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-21 01:24:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-21 01:24:58,949 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) [2021-11-21 01:24:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-21 01:24:58,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2021-11-21 01:24:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:24:58,950 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-21 01:24:58,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-21 01:24:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-21 01:24:58,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-21 01:24:58,953 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 01:24:58,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-21 01:24:58,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-21 01:26:51,066 WARN L227 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 178 DAG size of output: 178 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-21 01:27:27,547 WARN L227 SmtUtils]: Spent 36.48s on a formula simplification. DAG size of input: 149 DAG size of output: 149 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-21 01:29:30,714 WARN L227 SmtUtils]: Spent 2.04m on a formula simplification. DAG size of input: 180 DAG size of output: 180 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-21 01:30:07,715 WARN L227 SmtUtils]: Spent 36.78s on a formula simplification. DAG size of input: 149 DAG size of output: 149 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-21 01:30:16,107 INFO L854 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= |ULTIMATE.start_main_~l~0#1| 1) (= 2 (select |#length| 1)) (<= 2 |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:30:16,107 INFO L854 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= |ULTIMATE.start_main_~l~0#1| 1) (= 2 (select |#length| 1)) (<= 2 |ULTIMATE.start_main_~r~0#1|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:30:16,108 INFO L854 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (= (select |#valid| 0) 0) (<= |ULTIMATE.start_main_~n~0#1| 1000000) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:30:16,108 INFO L858 garLoopResultBuilder]: For program point L27(line 27) no Hoare annotation was computed. [2021-11-21 01:30:16,108 INFO L854 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (<= 2 |ULTIMATE.start_main_~l~0#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= 2 |ULTIMATE.start_main_~j~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (or (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|)) (= (select |#valid| 0) 0) (<= |ULTIMATE.start_main_~n~0#1| 1000000) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:30:16,108 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse27 (select |#memory_int| 1)) (.cse0 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse1 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|)) (.cse6 (= 2 (select |#length| 1))) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse8 (= 9 (select |#length| 2))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (<= .cse0 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (<= |ULTIMATE.start_main_~n~0#1| 1000000)) (.cse17 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= (select .cse27 0) 48)) (.cse21 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse22 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse23 (= (select .cse27 1) 0)) (.cse24 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~j~0#1| .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~j~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2021-11-21 01:30:16,108 INFO L854 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse29 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse28 (select |#memory_int| 1))) (let ((.cse1 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|)) (.cse5 (= 2 (select |#length| 1))) (.cse6 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse8 (= 9 (select |#length| 2))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (<= |ULTIMATE.start_main_~n~0#1| 1000000)) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= (select .cse28 0) 48)) (.cse21 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ .cse29 |ULTIMATE.start_main_~j~0#1|))) (.cse22 (or (<= .cse0 (+ 2 |ULTIMATE.start_main_~n~0#1|)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse0) .cse29))) (.cse23 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse24 (= (select .cse28 1) 0)) (.cse25 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse26 (< 0 |#StackHeapBarrier|)) (.cse27 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~j~0#1| .cse0) .cse1 .cse2 .cse3 (< .cse0 |ULTIMATE.start_main_~r~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~j~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2021-11-21 01:30:16,109 INFO L858 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2021-11-21 01:30:16,109 INFO L854 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~l~0#1|)) (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (<= |ULTIMATE.start_main_~n~0#1| 1000000) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= 1 |ULTIMATE.start_main_~l~0#1|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:30:16,109 INFO L854 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~l~0#1|)) (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (<= |ULTIMATE.start_main_~n~0#1| 1000000) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= 1 |ULTIMATE.start_main_~l~0#1|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:30:16,109 INFO L861 garLoopResultBuilder]: At program point L69(lines 24 70) the Hoare annotation is: true [2021-11-21 01:30:16,109 INFO L858 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2021-11-21 01:30:16,110 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-21 01:30:16,110 INFO L858 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2021-11-21 01:30:16,110 INFO L854 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse29 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse28 (select |#memory_int| 1))) (let ((.cse1 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|)) (.cse5 (= 2 (select |#length| 1))) (.cse6 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse8 (= 9 (select |#length| 2))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (<= |ULTIMATE.start_main_~n~0#1| 1000000)) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= (select .cse28 0) 48)) (.cse21 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ .cse29 |ULTIMATE.start_main_~j~0#1|))) (.cse22 (or (<= .cse0 (+ 2 |ULTIMATE.start_main_~n~0#1|)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse0) .cse29))) (.cse23 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse24 (= (select .cse28 1) 0)) (.cse25 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse26 (< 0 |#StackHeapBarrier|)) (.cse27 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~j~0#1| .cse0) .cse1 .cse2 .cse3 (< .cse0 |ULTIMATE.start_main_~r~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~j~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2021-11-21 01:30:16,110 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2021-11-21 01:30:16,110 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~l~0#1|)) (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (<= |ULTIMATE.start_main_~n~0#1| 1000000) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= 1 |ULTIMATE.start_main_~l~0#1|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:30:16,111 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-21 01:30:16,111 INFO L854 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 (* 2 |ULTIMATE.start_main_~l~0#1|)) (.cse29 (* 2 |ULTIMATE.start_main_~n~0#1|)) (.cse28 (select |#memory_int| 1))) (let ((.cse1 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|)) (.cse5 (= 2 (select |#length| 1))) (.cse6 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse8 (= 9 (select |#length| 2))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~n~0#1|)) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (<= 1 |ULTIMATE.start_main_~r~0#1|)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (<= |ULTIMATE.start_main_~n~0#1| 1000000)) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= (select .cse28 0) 48)) (.cse21 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ .cse29 |ULTIMATE.start_main_~j~0#1|))) (.cse22 (or (<= .cse0 (+ 2 |ULTIMATE.start_main_~n~0#1|)) (<= (+ |ULTIMATE.start_main_~r~0#1| .cse0) .cse29))) (.cse23 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse24 (= (select .cse28 1) 0)) (.cse25 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse26 (< 0 |#StackHeapBarrier|)) (.cse27 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~j~0#1| .cse0) .cse1 .cse2 .cse3 (< .cse0 |ULTIMATE.start_main_~r~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~j~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) [2021-11-21 01:30:16,111 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~j~0#1| (* 2 |ULTIMATE.start_main_~l~0#1|)) (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= 9 (select |#length| 2)) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (<= |ULTIMATE.start_main_~n~0#1| 1000000) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (<= 1 |ULTIMATE.start_main_~l~0#1|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:30:16,111 INFO L854 garLoopResultBuilder]: At program point L38-2(lines 38 58) the Hoare annotation is: (let ((.cse21 (select |#memory_int| 1))) (let ((.cse0 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse1 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse2 (<= (div (* |ULTIMATE.start_main_~j~0#1| (- 1)) (- 2)) |ULTIMATE.start_main_~i~0#1|)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse5 (= 9 (select |#length| 2))) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse7 (= (select |#valid| 1) 1)) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse9 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse10 (= (select |#valid| 0) 0)) (.cse11 (<= |ULTIMATE.start_main_~n~0#1| 1000000)) (.cse12 (= (select |#valid| 2) 1)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (= (select .cse21 0) 48)) (.cse15 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse16 (= (select .cse21 1) 0)) (.cse17 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse18 (< 0 |#StackHeapBarrier|)) (.cse19 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 |ULTIMATE.start_main_~j~0#1|) .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse20 (* 2 |ULTIMATE.start_main_~l~0#1|))) (and .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~n~0#1|) .cse4 .cse5 .cse6 (<= .cse20 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~j~0#1| .cse20) .cse7 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~r~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))))) [2021-11-21 01:30:16,112 INFO L858 garLoopResultBuilder]: For program point L38-3(lines 35 68) no Hoare annotation was computed. [2021-11-21 01:30:16,112 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 24 70) no Hoare annotation was computed. [2021-11-21 01:30:16,112 INFO L858 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2021-11-21 01:30:16,112 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse27 (select |#memory_int| 1)) (.cse0 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse1 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|)) (.cse6 (= 2 (select |#length| 1))) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse8 (= 9 (select |#length| 2))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (<= .cse0 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (<= |ULTIMATE.start_main_~n~0#1| 1000000)) (.cse17 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= (select .cse27 0) 48)) (.cse21 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse22 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse23 (= (select .cse27 1) 0)) (.cse24 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~j~0#1| .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~j~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2021-11-21 01:30:16,112 INFO L858 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2021-11-21 01:30:16,113 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 46) no Hoare annotation was computed. [2021-11-21 01:30:16,113 INFO L854 garLoopResultBuilder]: At program point L39-1(lines 39 46) the Hoare annotation is: (let ((.cse27 (select |#memory_int| 1)) (.cse0 (* 2 |ULTIMATE.start_main_~l~0#1|))) (let ((.cse1 (= |ULTIMATE.start_main_~l~0#1| (div |ULTIMATE.start_main_~n~0#1| 2))) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~l~0#1|)) (.cse6 (= 2 (select |#length| 1))) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse8 (= 9 (select |#length| 2))) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (<= 2 |ULTIMATE.start_main_~j~0#1|)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (<= .cse0 (+ 2 |ULTIMATE.start_main_~n~0#1|))) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse15 (= (select |#valid| 0) 0)) (.cse16 (<= |ULTIMATE.start_main_~n~0#1| 1000000)) (.cse17 (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~r~0#1|)) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= (select .cse27 0) 48)) (.cse21 (<= (+ |ULTIMATE.start_main_~r~0#1| (* 2 |ULTIMATE.start_main_~i~0#1|) 1) (+ (* 2 |ULTIMATE.start_main_~n~0#1|) |ULTIMATE.start_main_~j~0#1|))) (.cse22 (<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)) (.cse23 (= (select .cse27 1) 0)) (.cse24 (<= 1 |ULTIMATE.start_main_~l~0#1|)) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~j~0#1| .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and (<= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~j~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2021-11-21 01:30:16,113 INFO L858 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2021-11-21 01:30:16,113 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2021-11-21 01:30:16,113 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2021-11-21 01:30:16,114 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-11-21 01:30:16,114 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-21 01:30:16,114 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2021-11-21 01:30:16,117 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:30:16,119 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:30:16,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:30:16 BoogieIcfgContainer [2021-11-21 01:30:16,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:30:16,162 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:30:16,162 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:30:16,162 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:30:16,163 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:20:48" (3/4) ... [2021-11-21 01:30:16,165 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-21 01:30:16,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-11-21 01:30:16,174 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-11-21 01:30:16,174 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-21 01:30:16,174 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-21 01:30:16,175 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-21 01:30:16,175 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-21 01:30:16,195 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((l == n / 2 && argv == argv) && argc == \old(argc)) && j * -1 / -2 <= i) && 2 == unknown-#length-unknown[1]) && argv == argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && n <= 1000000) && n == r) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((argv == argv && argc == \old(argc)) && j * -1 / -2 <= i) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 * l <= j) && j <= 2 * l) && \valid[1] == 1) && j <= r) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && n <= 1000000) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) [2021-11-21 01:30:16,209 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-21 01:30:16,210 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:30:16,210 INFO L158 Benchmark]: Toolchain (without parser) took 568351.66ms. Allocated memory was 115.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 71.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 289.5MB. Max. memory is 16.1GB. [2021-11-21 01:30:16,211 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:30:16,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.97ms. Allocated memory is still 115.3MB. Free memory was 71.2MB in the beginning and 90.4MB in the end (delta: -19.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2021-11-21 01:30:16,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.53ms. Allocated memory is still 115.3MB. Free memory was 90.4MB in the beginning and 88.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:30:16,212 INFO L158 Benchmark]: Boogie Preprocessor took 24.82ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 87.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:30:16,212 INFO L158 Benchmark]: RCFGBuilder took 306.05ms. Allocated memory is still 115.3MB. Free memory was 87.6MB in the beginning and 75.4MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:30:16,213 INFO L158 Benchmark]: TraceAbstraction took 567649.66ms. Allocated memory was 115.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 75.0MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2021-11-21 01:30:16,213 INFO L158 Benchmark]: Witness Printer took 47.66ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:30:16,215 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.97ms. Allocated memory is still 115.3MB. Free memory was 71.2MB in the beginning and 90.4MB in the end (delta: -19.2MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.53ms. Allocated memory is still 115.3MB. Free memory was 90.4MB in the beginning and 88.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.82ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 87.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 306.05ms. Allocated memory is still 115.3MB. Free memory was 87.6MB in the beginning and 75.4MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 567649.66ms. Allocated memory was 115.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 75.0MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 47.66ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 567.5s, OverallIterations: 18, TraceHistogramMax: 25, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 317.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 755 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 578 mSDsluCounter, 3326 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2462 mSDsCounter, 887 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2385 IncrementalHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 887 mSolverCounterUnsat, 966 mSDtfsCounter, 2385 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1168 GetRequests, 952 SyntacticMatches, 25 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=17, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 473 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 284 PreInvPairs, 354 NumberOfFragments, 2514 HoareAnnotationTreeSize, 284 FomulaSimplifications, 425457 FormulaSimplificationTreeSizeReduction, 311.2s HoareSimplificationTime, 17 FomulaSimplificationsInter, 4433678 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1179 NumberOfCodeBlocks, 1179 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1468 ConstructedInterpolants, 0 QuantifiedInterpolants, 2592 SizeOfPredicates, 15 NumberOfNonLiveVariables, 831 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 7104/7215 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: OVERALL_TIME: 17.4s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 50, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 22, TOOLS_POST_TIME: 2.2s, TOOLS_POST_CALL_APPLICATIONS: 50, TOOLS_POST_CALL_TIME: 7.7s, TOOLS_POST_RETURN_APPLICATIONS: 40, TOOLS_POST_RETURN_TIME: 7.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 112, TOOLS_QUANTIFIERELIM_TIME: 17.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.3s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 102, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 61, DOMAIN_JOIN_TIME: 0.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 50, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 8.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 8.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 40, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 604, DAG_COMPRESSION_RETAINED_NODES: 105, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((l == n / 2 && argv == argv) && argc == \old(argc)) && j * -1 / -2 <= i) && 2 == unknown-#length-unknown[1]) && argv == argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 <= j) && \valid[1] == 1) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && n <= 1000000) && n == r) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((((((((argv == argv && argc == \old(argc)) && j * -1 / -2 <= i) && 2 == unknown-#length-unknown[1]) && r <= n) && argv == argv) && 9 == unknown-#length-unknown[2]) && argv == argv) && 2 * l <= j) && j <= 2 * l) && \valid[1] == 1) && j <= r) && argv == argv) && \old(argc) == \old(argc)) && \valid[0] == 0) && n <= 1000000) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && r + 2 * i + 1 <= 2 * n + j) && unknown-#memory_int-unknown[1][1] == 0) && 1 <= l) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2021-11-21 01:30:16,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ee266ac-83c6-48c4-8ca7-022e52fc42ed/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE