./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17a767ebf51f6a233211ab82288cb9185242fdcf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:23:55,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:23:55,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:23:55,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:23:55,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:23:55,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:23:55,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:23:55,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:23:55,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:23:55,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:23:55,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:23:55,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:23:55,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:23:55,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:23:55,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:23:55,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:23:55,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:23:55,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:23:55,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:23:55,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:23:55,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:23:55,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:23:55,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:23:55,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:23:55,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:23:55,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:23:55,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:23:55,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:23:55,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:23:55,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:23:55,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:23:55,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:23:55,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:23:55,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:23:55,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:23:55,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:23:55,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:23:55,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:23:55,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:23:55,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:23:55,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:23:55,748 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:23:55,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:23:55,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:23:55,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:23:55,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:23:55,759 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:23:55,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:23:55,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:23:55,761 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:23:55,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:23:55,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:23:55,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:23:55,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:23:55,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:23:55,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:23:55,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:23:55,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:23:55,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:23:55,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:23:55,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:23:55,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:23:55,762 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:23:55,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17a767ebf51f6a233211ab82288cb9185242fdcf [2019-12-07 17:23:55,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:23:55,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:23:55,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:23:55,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:23:55,872 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:23:55,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label57.c [2019-12-07 17:23:55,909 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/data/d3ccdd5a4/5b1660e2c2e449dea1fc57e3c57a1922/FLAG23e216c18 [2019-12-07 17:23:56,408 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:23:56,409 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/sv-benchmarks/c/eca-rers2012/Problem03_label57.c [2019-12-07 17:23:56,420 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/data/d3ccdd5a4/5b1660e2c2e449dea1fc57e3c57a1922/FLAG23e216c18 [2019-12-07 17:23:56,893 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/data/d3ccdd5a4/5b1660e2c2e449dea1fc57e3c57a1922 [2019-12-07 17:23:56,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:23:56,897 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:23:56,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:23:56,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:23:56,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:23:56,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774acec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56, skipping insertion in model container [2019-12-07 17:23:56,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:23:56,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:23:57,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:23:57,333 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:23:57,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:23:57,485 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:23:57,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57 WrapperNode [2019-12-07 17:23:57,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:23:57,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:23:57,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:23:57,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:23:57,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:23:57,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:23:57,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:23:57,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:23:57,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... [2019-12-07 17:23:57,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:23:57,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:23:57,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:23:57,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:23:57,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:23:57,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:23:57,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:23:58,806 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:23:58,806 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:23:58,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:23:58 BoogieIcfgContainer [2019-12-07 17:23:58,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:23:58,808 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:23:58,808 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:23:58,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:23:58,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:23:56" (1/3) ... [2019-12-07 17:23:58,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebd9fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:23:58, skipping insertion in model container [2019-12-07 17:23:58,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:57" (2/3) ... [2019-12-07 17:23:58,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebd9fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:23:58, skipping insertion in model container [2019-12-07 17:23:58,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:23:58" (3/3) ... [2019-12-07 17:23:58,812 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label57.c [2019-12-07 17:23:58,819 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:23:58,824 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:23:58,832 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:23:58,851 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:23:58,851 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:23:58,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:23:58,852 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:23:58,852 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:23:58,852 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:23:58,852 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:23:58,852 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:23:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 17:23:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 17:23:58,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:58,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:58,880 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:58,885 INFO L82 PathProgramCache]: Analyzing trace with hash -10226053, now seen corresponding path program 1 times [2019-12-07 17:23:58,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:58,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044829474] [2019-12-07 17:23:58,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:23:59,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044829474] [2019-12-07 17:23:59,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:59,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:23:59,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324875376] [2019-12-07 17:23:59,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:23:59,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:59,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:23:59,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:23:59,232 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-12-07 17:24:00,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:00,051 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-12-07 17:24:00,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:00,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-12-07 17:24:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:00,067 INFO L225 Difference]: With dead ends: 829 [2019-12-07 17:24:00,067 INFO L226 Difference]: Without dead ends: 463 [2019-12-07 17:24:00,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-12-07 17:24:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-12-07 17:24:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-07 17:24:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-12-07 17:24:00,126 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 161 [2019-12-07 17:24:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:00,127 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-12-07 17:24:00,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-12-07 17:24:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 17:24:00,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:00,131 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:00,131 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:00,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1203029931, now seen corresponding path program 1 times [2019-12-07 17:24:00,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:00,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668280108] [2019-12-07 17:24:00,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:24:00,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668280108] [2019-12-07 17:24:00,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:00,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:00,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171737764] [2019-12-07 17:24:00,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:00,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:00,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:00,199 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-12-07 17:24:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:01,193 INFO L93 Difference]: Finished difference Result 1735 states and 2827 transitions. [2019-12-07 17:24:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:01,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-12-07 17:24:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:01,199 INFO L225 Difference]: With dead ends: 1735 [2019-12-07 17:24:01,199 INFO L226 Difference]: Without dead ends: 1288 [2019-12-07 17:24:01,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:01,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-12-07 17:24:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 859. [2019-12-07 17:24:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-07 17:24:01,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-12-07 17:24:01,224 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 166 [2019-12-07 17:24:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:01,224 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-12-07 17:24:01,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-12-07 17:24:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-07 17:24:01,227 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:01,228 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:01,228 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:01,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:01,228 INFO L82 PathProgramCache]: Analyzing trace with hash -938777153, now seen corresponding path program 1 times [2019-12-07 17:24:01,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:01,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366872639] [2019-12-07 17:24:01,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:24:01,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366872639] [2019-12-07 17:24:01,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:01,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:01,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835730883] [2019-12-07 17:24:01,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:01,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:01,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:01,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:01,285 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-12-07 17:24:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:01,610 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-12-07 17:24:01,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:01,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-12-07 17:24:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:01,615 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 17:24:01,615 INFO L226 Difference]: Without dead ends: 838 [2019-12-07 17:24:01,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:01,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-12-07 17:24:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-12-07 17:24:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-12-07 17:24:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-12-07 17:24:01,629 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 174 [2019-12-07 17:24:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:01,629 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-12-07 17:24:01,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-12-07 17:24:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 17:24:01,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:01,632 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:01,632 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:01,632 INFO L82 PathProgramCache]: Analyzing trace with hash 133702577, now seen corresponding path program 1 times [2019-12-07 17:24:01,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:01,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851701947] [2019-12-07 17:24:01,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:24:01,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851701947] [2019-12-07 17:24:01,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:01,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:01,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080930309] [2019-12-07 17:24:01,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:01,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:01,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:01,696 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-12-07 17:24:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:02,670 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-12-07 17:24:02,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:02,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-12-07 17:24:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:02,683 INFO L225 Difference]: With dead ends: 3313 [2019-12-07 17:24:02,683 INFO L226 Difference]: Without dead ends: 2477 [2019-12-07 17:24:02,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-12-07 17:24:02,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-12-07 17:24:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-12-07 17:24:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-12-07 17:24:02,725 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 175 [2019-12-07 17:24:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:02,725 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-12-07 17:24:02,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-12-07 17:24:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 17:24:02,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:02,729 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:02,729 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1756622090, now seen corresponding path program 1 times [2019-12-07 17:24:02,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:02,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841591556] [2019-12-07 17:24:02,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 17:24:02,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841591556] [2019-12-07 17:24:02,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:02,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:02,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926867121] [2019-12-07 17:24:02,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:02,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:02,792 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-12-07 17:24:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:03,382 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-12-07 17:24:03,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:03,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-12-07 17:24:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:03,393 INFO L225 Difference]: With dead ends: 4133 [2019-12-07 17:24:03,394 INFO L226 Difference]: Without dead ends: 2480 [2019-12-07 17:24:03,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-12-07 17:24:03,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-12-07 17:24:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-12-07 17:24:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-12-07 17:24:03,439 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 178 [2019-12-07 17:24:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:03,439 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-12-07 17:24:03,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:03,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-12-07 17:24:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 17:24:03,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:03,443 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:03,443 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:03,443 INFO L82 PathProgramCache]: Analyzing trace with hash -198454923, now seen corresponding path program 1 times [2019-12-07 17:24:03,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:03,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904336679] [2019-12-07 17:24:03,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 17:24:03,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904336679] [2019-12-07 17:24:03,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:03,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:03,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122349499] [2019-12-07 17:24:03,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:03,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:03,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:03,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:03,492 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-12-07 17:24:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:03,774 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-12-07 17:24:03,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:03,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-12-07 17:24:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:03,792 INFO L225 Difference]: With dead ends: 7424 [2019-12-07 17:24:03,792 INFO L226 Difference]: Without dead ends: 4947 [2019-12-07 17:24:03,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:03,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-12-07 17:24:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-12-07 17:24:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-12-07 17:24:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-12-07 17:24:03,885 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 181 [2019-12-07 17:24:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:03,885 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-12-07 17:24:03,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-12-07 17:24:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-07 17:24:03,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:03,889 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:03,890 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:03,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1859199098, now seen corresponding path program 1 times [2019-12-07 17:24:03,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:03,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083403504] [2019-12-07 17:24:03,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:24:03,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083403504] [2019-12-07 17:24:03,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:03,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:03,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52174892] [2019-12-07 17:24:03,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:03,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:03,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:03,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:03,938 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-12-07 17:24:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:04,514 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-12-07 17:24:04,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:04,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-12-07 17:24:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:04,546 INFO L225 Difference]: With dead ends: 14560 [2019-12-07 17:24:04,546 INFO L226 Difference]: Without dead ends: 9617 [2019-12-07 17:24:04,550 INFO L630 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 [2019-12-07 17:24:04,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-12-07 17:24:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-12-07 17:24:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-12-07 17:24:04,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12493 transitions. [2019-12-07 17:24:04,641 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12493 transitions. Word has length 183 [2019-12-07 17:24:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:04,642 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12493 transitions. [2019-12-07 17:24:04,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12493 transitions. [2019-12-07 17:24:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 17:24:04,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:04,648 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:04,648 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:04,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1527292661, now seen corresponding path program 2 times [2019-12-07 17:24:04,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:04,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481674555] [2019-12-07 17:24:04,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:24:04,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481674555] [2019-12-07 17:24:04,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:04,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:04,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565192158] [2019-12-07 17:24:04,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:04,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:04,695 INFO L87 Difference]: Start difference. First operand 9615 states and 12493 transitions. Second operand 3 states. [2019-12-07 17:24:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:05,428 INFO L93 Difference]: Finished difference Result 26540 states and 34559 transitions. [2019-12-07 17:24:05,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:05,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-12-07 17:24:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:05,471 INFO L225 Difference]: With dead ends: 26540 [2019-12-07 17:24:05,471 INFO L226 Difference]: Without dead ends: 16927 [2019-12-07 17:24:05,478 INFO L630 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 [2019-12-07 17:24:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-12-07 17:24:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-12-07 17:24:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-12-07 17:24:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20089 transitions. [2019-12-07 17:24:05,629 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20089 transitions. Word has length 185 [2019-12-07 17:24:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:05,629 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20089 transitions. [2019-12-07 17:24:05,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20089 transitions. [2019-12-07 17:24:05,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-12-07 17:24:05,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:05,639 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:05,639 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:05,639 INFO L82 PathProgramCache]: Analyzing trace with hash 899468712, now seen corresponding path program 1 times [2019-12-07 17:24:05,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:05,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041699399] [2019-12-07 17:24:05,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 17:24:05,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041699399] [2019-12-07 17:24:05,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:05,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:05,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752788456] [2019-12-07 17:24:05,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:05,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:05,702 INFO L87 Difference]: Start difference. First operand 16923 states and 20089 transitions. Second operand 4 states. [2019-12-07 17:24:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:06,288 INFO L93 Difference]: Finished difference Result 33846 states and 40180 transitions. [2019-12-07 17:24:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:06,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-12-07 17:24:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:06,310 INFO L225 Difference]: With dead ends: 33846 [2019-12-07 17:24:06,310 INFO L226 Difference]: Without dead ends: 16925 [2019-12-07 17:24:06,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16925 states. [2019-12-07 17:24:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16925 to 16923. [2019-12-07 17:24:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-12-07 17:24:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 19544 transitions. [2019-12-07 17:24:06,469 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 19544 transitions. Word has length 203 [2019-12-07 17:24:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:06,469 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 19544 transitions. [2019-12-07 17:24:06,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 19544 transitions. [2019-12-07 17:24:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-12-07 17:24:06,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:06,481 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:06,481 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash -361443703, now seen corresponding path program 1 times [2019-12-07 17:24:06,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:06,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696827596] [2019-12-07 17:24:06,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 17:24:06,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696827596] [2019-12-07 17:24:06,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:06,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:24:06,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686513575] [2019-12-07 17:24:06,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:24:06,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:24:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:06,652 INFO L87 Difference]: Start difference. First operand 16923 states and 19544 transitions. Second operand 5 states. [2019-12-07 17:24:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:07,809 INFO L93 Difference]: Finished difference Result 77631 states and 89804 transitions. [2019-12-07 17:24:07,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:24:07,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2019-12-07 17:24:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:07,872 INFO L225 Difference]: With dead ends: 77631 [2019-12-07 17:24:07,872 INFO L226 Difference]: Without dead ends: 60710 [2019-12-07 17:24:07,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:24:07,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60710 states. [2019-12-07 17:24:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60710 to 60704. [2019-12-07 17:24:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60704 states. [2019-12-07 17:24:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60704 states to 60704 states and 70206 transitions. [2019-12-07 17:24:08,453 INFO L78 Accepts]: Start accepts. Automaton has 60704 states and 70206 transitions. Word has length 228 [2019-12-07 17:24:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:08,453 INFO L462 AbstractCegarLoop]: Abstraction has 60704 states and 70206 transitions. [2019-12-07 17:24:08,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:24:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 60704 states and 70206 transitions. [2019-12-07 17:24:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-12-07 17:24:08,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:08,466 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:08,466 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1215433345, now seen corresponding path program 1 times [2019-12-07 17:24:08,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:08,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300466429] [2019-12-07 17:24:08,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:24:08,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300466429] [2019-12-07 17:24:08,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:08,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:08,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770125752] [2019-12-07 17:24:08,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:08,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:08,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:08,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:08,541 INFO L87 Difference]: Start difference. First operand 60704 states and 70206 transitions. Second operand 3 states. [2019-12-07 17:24:09,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:09,361 INFO L93 Difference]: Finished difference Result 143587 states and 166565 transitions. [2019-12-07 17:24:09,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:09,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-12-07 17:24:09,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:09,431 INFO L225 Difference]: With dead ends: 143587 [2019-12-07 17:24:09,431 INFO L226 Difference]: Without dead ends: 82885 [2019-12-07 17:24:09,465 INFO L630 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 [2019-12-07 17:24:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82885 states. [2019-12-07 17:24:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82885 to 82831. [2019-12-07 17:24:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82831 states. [2019-12-07 17:24:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82831 states to 82831 states and 95030 transitions. [2019-12-07 17:24:10,307 INFO L78 Accepts]: Start accepts. Automaton has 82831 states and 95030 transitions. Word has length 231 [2019-12-07 17:24:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:10,307 INFO L462 AbstractCegarLoop]: Abstraction has 82831 states and 95030 transitions. [2019-12-07 17:24:10,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 82831 states and 95030 transitions. [2019-12-07 17:24:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-12-07 17:24:10,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:10,325 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:10,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:10,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:10,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1616179030, now seen corresponding path program 1 times [2019-12-07 17:24:10,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:10,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636363206] [2019-12-07 17:24:10,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 17:24:10,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636363206] [2019-12-07 17:24:10,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210802855] [2019-12-07 17:24:10,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:24:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:10,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:24:10,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:24:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 17:24:10,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:24:10,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 17:24:10,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534173134] [2019-12-07 17:24:10,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:10,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:10,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:24:10,605 INFO L87 Difference]: Start difference. First operand 82831 states and 95030 transitions. Second operand 3 states. [2019-12-07 17:24:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:11,561 INFO L93 Difference]: Finished difference Result 161604 states and 185369 transitions. [2019-12-07 17:24:11,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:11,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-12-07 17:24:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:11,629 INFO L225 Difference]: With dead ends: 161604 [2019-12-07 17:24:11,629 INFO L226 Difference]: Without dead ends: 78775 [2019-12-07 17:24:11,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:24:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78775 states. [2019-12-07 17:24:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78775 to 72876. [2019-12-07 17:24:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72876 states. [2019-12-07 17:24:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72876 states to 72876 states and 81916 transitions. [2019-12-07 17:24:12,301 INFO L78 Accepts]: Start accepts. Automaton has 72876 states and 81916 transitions. Word has length 239 [2019-12-07 17:24:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:12,302 INFO L462 AbstractCegarLoop]: Abstraction has 72876 states and 81916 transitions. [2019-12-07 17:24:12,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 72876 states and 81916 transitions. [2019-12-07 17:24:12,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-12-07 17:24:12,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:12,320 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:12,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:24:12,521 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:12,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1709211579, now seen corresponding path program 1 times [2019-12-07 17:24:12,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:12,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665636867] [2019-12-07 17:24:12,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:24:12,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665636867] [2019-12-07 17:24:12,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:12,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:24:12,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749711326] [2019-12-07 17:24:12,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:12,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:12,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:12,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:12,648 INFO L87 Difference]: Start difference. First operand 72876 states and 81916 transitions. Second operand 3 states. [2019-12-07 17:24:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:13,715 INFO L93 Difference]: Finished difference Result 164423 states and 185526 transitions. [2019-12-07 17:24:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:13,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-12-07 17:24:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:13,793 INFO L225 Difference]: With dead ends: 164423 [2019-12-07 17:24:13,793 INFO L226 Difference]: Without dead ends: 91549 [2019-12-07 17:24:13,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:24:13,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91549 states. [2019-12-07 17:24:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91549 to 91549. [2019-12-07 17:24:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91549 states. [2019-12-07 17:24:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91549 states to 91549 states and 100388 transitions. [2019-12-07 17:24:14,599 INFO L78 Accepts]: Start accepts. Automaton has 91549 states and 100388 transitions. Word has length 272 [2019-12-07 17:24:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:14,600 INFO L462 AbstractCegarLoop]: Abstraction has 91549 states and 100388 transitions. [2019-12-07 17:24:14,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 91549 states and 100388 transitions. [2019-12-07 17:24:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-12-07 17:24:14,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:14,613 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:14,613 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:14,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:14,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1997086450, now seen corresponding path program 1 times [2019-12-07 17:24:14,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:14,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432378946] [2019-12-07 17:24:14,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 3 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-12-07 17:24:14,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432378946] [2019-12-07 17:24:14,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780700740] [2019-12-07 17:24:14,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:24:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:14,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:24:14,888 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:24:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-12-07 17:24:15,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:24:15,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-12-07 17:24:15,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294825657] [2019-12-07 17:24:15,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:15,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:15,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:15,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:15,157 INFO L87 Difference]: Start difference. First operand 91549 states and 100388 transitions. Second operand 3 states. [2019-12-07 17:24:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:15,661 INFO L93 Difference]: Finished difference Result 268117 states and 293771 transitions. [2019-12-07 17:24:15,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:15,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-12-07 17:24:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:15,819 INFO L225 Difference]: With dead ends: 268117 [2019-12-07 17:24:15,819 INFO L226 Difference]: Without dead ends: 176570 [2019-12-07 17:24:15,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176570 states. [2019-12-07 17:24:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176570 to 176566. [2019-12-07 17:24:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176566 states. [2019-12-07 17:24:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176566 states to 176566 states and 193374 transitions. [2019-12-07 17:24:18,866 INFO L78 Accepts]: Start accepts. Automaton has 176566 states and 193374 transitions. Word has length 329 [2019-12-07 17:24:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:18,867 INFO L462 AbstractCegarLoop]: Abstraction has 176566 states and 193374 transitions. [2019-12-07 17:24:18,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 176566 states and 193374 transitions. [2019-12-07 17:24:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-12-07 17:24:18,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:18,896 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:19,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:24:19,098 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:19,099 INFO L82 PathProgramCache]: Analyzing trace with hash -731096947, now seen corresponding path program 1 times [2019-12-07 17:24:19,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:19,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146638814] [2019-12-07 17:24:19,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-12-07 17:24:19,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146638814] [2019-12-07 17:24:19,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:19,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:19,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649923726] [2019-12-07 17:24:19,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:19,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:19,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:19,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:19,271 INFO L87 Difference]: Start difference. First operand 176566 states and 193374 transitions. Second operand 4 states. [2019-12-07 17:24:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:21,389 INFO L93 Difference]: Finished difference Result 359920 states and 393955 transitions. [2019-12-07 17:24:21,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:21,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-12-07 17:24:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:21,573 INFO L225 Difference]: With dead ends: 359920 [2019-12-07 17:24:21,574 INFO L226 Difference]: Without dead ends: 183356 [2019-12-07 17:24:21,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183356 states. [2019-12-07 17:24:23,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183356 to 176160. [2019-12-07 17:24:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176160 states. [2019-12-07 17:24:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176160 states to 176160 states and 192548 transitions. [2019-12-07 17:24:23,338 INFO L78 Accepts]: Start accepts. Automaton has 176160 states and 192548 transitions. Word has length 387 [2019-12-07 17:24:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:23,338 INFO L462 AbstractCegarLoop]: Abstraction has 176160 states and 192548 transitions. [2019-12-07 17:24:23,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 176160 states and 192548 transitions. [2019-12-07 17:24:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-12-07 17:24:23,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:23,371 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:23,372 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:23,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1850717027, now seen corresponding path program 1 times [2019-12-07 17:24:23,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:23,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495911206] [2019-12-07 17:24:23,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-12-07 17:24:23,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495911206] [2019-12-07 17:24:23,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:23,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:24:23,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734203121] [2019-12-07 17:24:23,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:23,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:23,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:23,524 INFO L87 Difference]: Start difference. First operand 176160 states and 192548 transitions. Second operand 4 states. [2019-12-07 17:24:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:25,248 INFO L93 Difference]: Finished difference Result 361734 states and 395668 transitions. [2019-12-07 17:24:25,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:24:25,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 408 [2019-12-07 17:24:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:25,426 INFO L225 Difference]: With dead ends: 361734 [2019-12-07 17:24:25,427 INFO L226 Difference]: Without dead ends: 185576 [2019-12-07 17:24:25,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185576 states. [2019-12-07 17:24:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185576 to 172114. [2019-12-07 17:24:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172114 states. [2019-12-07 17:24:27,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172114 states to 172114 states and 188084 transitions. [2019-12-07 17:24:27,272 INFO L78 Accepts]: Start accepts. Automaton has 172114 states and 188084 transitions. Word has length 408 [2019-12-07 17:24:27,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:27,272 INFO L462 AbstractCegarLoop]: Abstraction has 172114 states and 188084 transitions. [2019-12-07 17:24:27,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 172114 states and 188084 transitions. [2019-12-07 17:24:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-12-07 17:24:27,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:27,302 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:27,302 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash 613897899, now seen corresponding path program 1 times [2019-12-07 17:24:27,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:24:27,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785840919] [2019-12-07 17:24:27,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:24:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 146 proven. 3 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-12-07 17:24:27,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785840919] [2019-12-07 17:24:27,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077682329] [2019-12-07 17:24:27,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:24:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:27,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:24:27,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:24:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-12-07 17:24:27,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:24:27,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 17:24:27,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585627163] [2019-12-07 17:24:27,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:24:27,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:24:27,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:24:27,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:27,718 INFO L87 Difference]: Start difference. First operand 172114 states and 188084 transitions. Second operand 3 states. [2019-12-07 17:24:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:29,201 INFO L93 Difference]: Finished difference Result 341404 states and 372971 transitions. [2019-12-07 17:24:29,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:29,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-12-07 17:24:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:29,202 INFO L225 Difference]: With dead ends: 341404 [2019-12-07 17:24:29,202 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:24:29,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:24:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:24:29,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:24:29,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:24:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:24:29,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 420 [2019-12-07 17:24:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:29,295 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:24:29,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:24:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:24:29,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:24:29,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:24:29,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:24:33,244 WARN L192 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 1057 DAG size of output: 403 [2019-12-07 17:24:36,983 WARN L192 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 1057 DAG size of output: 403 [2019-12-07 17:24:39,955 WARN L192 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 377 DAG size of output: 79 [2019-12-07 17:24:42,893 WARN L192 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 377 DAG size of output: 79 [2019-12-07 17:24:42,895 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 17:24:42,895 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 17:24:42,895 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,895 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,895 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,895 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,895 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,896 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,897 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 17:24:42,898 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,899 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,900 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,901 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,902 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,903 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,904 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse3 (= 1 ~a6~0)) (.cse4 (= ~a12~0 1))) (let ((.cse0 (<= ~a3~0 0)) (.cse16 (= ~a13~0 1)) (.cse7 (= 1 ~a3~0)) (.cse8 (not (= 1 ~a7~0))) (.cse13 (not .cse4)) (.cse6 (= ~a10~0 1)) (.cse15 (<= 2 ~a3~0)) (.cse9 (<= ~a11~0 0)) (.cse10 (<= ~a26~0 0)) (.cse1 (= ~a27~0 1)) (.cse2 (= 1 ~a5~0)) (.cse14 (not .cse3)) (.cse5 (= ~a11~0 1)) (.cse11 (= ~a26~0 1)) (.cse12 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse7 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse6 .cse2 .cse8 .cse9 .cse11 .cse12) (and .cse6 .cse7 .cse2 .cse13 .cse9 .cse14 .cse10) (and .cse15 .cse2 .cse9 .cse14 .cse11) (and .cse0 .cse2 .cse9 .cse14 .cse11 .cse12) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5 .cse11) (and .cse16 .cse2 .cse3 .cse13 .cse5 .cse11) (and .cse2 .cse1 .cse13 .cse10 .cse5) (and .cse2 .cse13 .cse5 .cse11 .cse12) (and .cse6 .cse15 .cse2 .cse8 .cse9 .cse11) (and .cse7 .cse2 .cse13 .cse5 .cse11) (and .cse7 .cse2 .cse1 .cse3 .cse13 .cse5) (and .cse0 .cse6 .cse2 .cse1 .cse3 .cse13 .cse5) (and .cse0 .cse2 .cse3 .cse5 .cse11) (and .cse7 .cse2 .cse5 .cse14 .cse11) (and .cse0 .cse2 .cse9 .cse10 .cse14) (and .cse15 .cse1 .cse2 .cse9 .cse14 .cse10) (and .cse0 .cse2 .cse9 .cse10 .cse12) (and .cse15 .cse2 .cse13 .cse14 .cse10 .cse5) (and .cse2 .cse1 .cse9 .cse13 .cse10) (and .cse15 .cse2 .cse9 .cse11 .cse12) (and .cse6 .cse2 .cse3 .cse8 .cse9 .cse10 .cse12) (and .cse1 .cse2 .cse4 .cse9 .cse11) (and .cse16 .cse7 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse2 .cse13 .cse9 .cse14 .cse11) (and .cse7 .cse2 .cse3 .cse9 .cse11) (and .cse6 .cse15 .cse2 .cse5 .cse14 .cse11) (and .cse15 .cse2 .cse3 .cse13 .cse9 .cse10) (and .cse6 .cse2 .cse1 .cse13 .cse9 .cse14 .cse11) (and .cse15 .cse2 .cse5 .cse14 .cse11 .cse12) (and .cse6 .cse2 .cse3 .cse13 .cse9 .cse11) (and .cse2 .cse13 .cse9 .cse11 .cse12) (and .cse15 .cse1 .cse2 .cse5 .cse11 .cse12) (and .cse6 .cse2 .cse5 .cse14 .cse11 .cse12) (and .cse6 .cse2 .cse1 .cse3 .cse8 .cse5 .cse12) (and .cse15 .cse2 .cse1 .cse13 .cse14 .cse5 .cse11) (and .cse6 .cse1 .cse2 .cse5 .cse11 .cse12) (and .cse15 .cse1 .cse2 .cse9 .cse11) (and .cse2 .cse1 .cse3 .cse13 .cse5 .cse12) (and .cse6 .cse15 .cse1 .cse2 .cse9 .cse10) (and .cse1 .cse2 .cse14 .cse5 .cse11 .cse12)))) [2019-12-07 17:24:42,904 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1518) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,905 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 17:24:42,906 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse3 (= 1 ~a6~0)) (.cse4 (= ~a12~0 1))) (let ((.cse0 (<= ~a3~0 0)) (.cse16 (= ~a13~0 1)) (.cse7 (= 1 ~a3~0)) (.cse8 (not (= 1 ~a7~0))) (.cse13 (not .cse4)) (.cse6 (= ~a10~0 1)) (.cse15 (<= 2 ~a3~0)) (.cse9 (<= ~a11~0 0)) (.cse10 (<= ~a26~0 0)) (.cse1 (= ~a27~0 1)) (.cse2 (= 1 ~a5~0)) (.cse14 (not .cse3)) (.cse5 (= ~a11~0 1)) (.cse11 (= ~a26~0 1)) (.cse12 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse7 .cse3 .cse8 .cse9 .cse10) (and .cse0 .cse6 .cse2 .cse8 .cse9 .cse11 .cse12) (and .cse6 .cse7 .cse2 .cse13 .cse9 .cse14 .cse10) (and .cse15 .cse2 .cse9 .cse14 .cse11) (and .cse0 .cse2 .cse9 .cse14 .cse11 .cse12) (and .cse0 .cse6 .cse1 .cse2 .cse4 .cse5 .cse11) (and .cse16 .cse2 .cse3 .cse13 .cse5 .cse11) (and .cse2 .cse1 .cse13 .cse10 .cse5) (and .cse2 .cse13 .cse5 .cse11 .cse12) (and .cse6 .cse15 .cse2 .cse8 .cse9 .cse11) (and .cse7 .cse2 .cse13 .cse5 .cse11) (and .cse7 .cse2 .cse1 .cse3 .cse13 .cse5) (and .cse0 .cse6 .cse2 .cse1 .cse3 .cse13 .cse5) (and .cse0 .cse2 .cse3 .cse5 .cse11) (and .cse7 .cse2 .cse5 .cse14 .cse11) (and .cse0 .cse2 .cse9 .cse10 .cse14) (and .cse15 .cse1 .cse2 .cse9 .cse14 .cse10) (and .cse0 .cse2 .cse9 .cse10 .cse12) (and .cse15 .cse2 .cse13 .cse14 .cse10 .cse5) (and .cse2 .cse1 .cse9 .cse13 .cse10) (and .cse15 .cse2 .cse9 .cse11 .cse12) (and .cse6 .cse2 .cse3 .cse8 .cse9 .cse10 .cse12) (and .cse1 .cse2 .cse4 .cse9 .cse11) (and .cse16 .cse7 .cse2 .cse3 .cse10 .cse5 .cse12) (and .cse7 .cse2 .cse13 .cse9 .cse14 .cse11) (and .cse7 .cse2 .cse3 .cse9 .cse11) (and .cse6 .cse15 .cse2 .cse5 .cse14 .cse11) (and .cse15 .cse2 .cse3 .cse13 .cse9 .cse10) (and .cse6 .cse2 .cse1 .cse13 .cse9 .cse14 .cse11) (and .cse15 .cse2 .cse5 .cse14 .cse11 .cse12) (and .cse6 .cse2 .cse3 .cse13 .cse9 .cse11) (and .cse2 .cse13 .cse9 .cse11 .cse12) (and .cse15 .cse1 .cse2 .cse5 .cse11 .cse12) (and .cse6 .cse2 .cse5 .cse14 .cse11 .cse12) (and .cse6 .cse2 .cse1 .cse3 .cse8 .cse5 .cse12) (and .cse15 .cse2 .cse1 .cse13 .cse14 .cse5 .cse11) (and .cse6 .cse1 .cse2 .cse5 .cse11 .cse12) (and .cse15 .cse1 .cse2 .cse9 .cse11) (and .cse2 .cse1 .cse3 .cse13 .cse5 .cse12) (and .cse6 .cse15 .cse1 .cse2 .cse9 .cse10) (and .cse1 .cse2 .cse14 .cse5 .cse11 .cse12)))) [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,907 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,908 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,909 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,910 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,911 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,912 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 17:24:42,913 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 17:24:42,914 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 17:24:42,915 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 17:24:42,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:24:42 BoogieIcfgContainer [2019-12-07 17:24:42,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:24:42,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:24:42,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:24:42,958 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:24:42,958 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:23:58" (3/4) ... [2019-12-07 17:24:42,961 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:24:42,990 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:24:42,992 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:24:43,134 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9388783b-49e2-4738-b1db-f12cdeb291c6/bin/uautomizer/witness.graphml [2019-12-07 17:24:43,134 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:24:43,135 INFO L168 Benchmark]: Toolchain (without parser) took 46238.72 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 938.2 MB in the beginning and 1.8 GB in the end (delta: -899.1 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-12-07 17:24:43,135 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:24:43,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 588.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -96.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:43,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:43,136 INFO L168 Benchmark]: Boogie Preprocessor took 64.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:43,136 INFO L168 Benchmark]: RCFGBuilder took 1176.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.2 MB in the end (delta: 15.2 MB). Peak memory consumption was 198.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:43,136 INFO L168 Benchmark]: TraceAbstraction took 44149.61 ms. Allocated memory was 1.1 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 992.2 MB in the beginning and 1.9 GB in the end (delta: -927.1 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 17:24:43,137 INFO L168 Benchmark]: Witness Printer took 176.48 ms. Allocated memory is still 5.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 82.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:24:43,138 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 588.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 938.2 MB in the beginning and 1.0 GB in the end (delta: -96.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1176.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 992.2 MB in the end (delta: 15.2 MB). Peak memory consumption was 198.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44149.61 ms. Allocated memory was 1.1 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 992.2 MB in the beginning and 1.9 GB in the end (delta: -927.1 MB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 176.48 ms. Allocated memory is still 5.3 GB. Free memory was 1.9 GB in the beginning and 1.8 GB in the end (delta: 82.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1518]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) || ((((((a10 == 1 && 1 == a5) && 1 == a3) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 <= 0)) || ((((((a3 <= 0 && a10 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((a10 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 <= 0)) || ((((2 <= a3 && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 == 1) && a16 == 1)) || ((((((a3 <= 0 && a10 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && a26 == 1)) || (((((a13 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || ((((1 == a5 && a27 == 1) && !(a12 == 1)) && a26 <= 0) && a11 == 1)) || ((((1 == a5 && !(a12 == 1)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((a10 == 1 && 2 <= a3) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || ((((1 == a3 && 1 == a5) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || (((((1 == a3 && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || ((((((a3 <= 0 && a10 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || ((((a3 <= 0 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((1 == a3 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1)) || ((((a3 <= 0 && 1 == a5) && a11 <= 0) && a26 <= 0) && !(1 == a6))) || (((((2 <= a3 && a27 == 1) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 <= 0)) || ((((a3 <= 0 && 1 == a5) && a11 <= 0) && a26 <= 0) && a16 == 1)) || (((((2 <= a3 && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a26 <= 0) && a11 == 1)) || ((((1 == a5 && a27 == 1) && a11 <= 0) && !(a12 == 1)) && a26 <= 0)) || ((((2 <= a3 && 1 == a5) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((a10 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && a16 == 1)) || ((((a27 == 1 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1)) || ((((((a13 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a26 <= 0) && a11 == 1) && a16 == 1)) || (((((1 == a3 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((1 == a3 && 1 == a5) && 1 == a6) && a11 <= 0) && a26 == 1)) || (((((a10 == 1 && 2 <= a3) && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a26 <= 0)) || ((((((a10 == 1 && 1 == a5) && a27 == 1) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1)) || (((((a10 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || ((((1 == a5 && !(a12 == 1)) && a11 <= 0) && a26 == 1) && a16 == 1)) || (((((2 <= a3 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((a10 == 1 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1)) || ((((((a10 == 1 && 1 == a5) && a27 == 1) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1)) || ((((((2 <= a3 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1)) || (((((a10 == 1 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((2 <= a3 && a27 == 1) && 1 == a5) && a11 <= 0) && a26 == 1)) || (((((1 == a5 && a27 == 1) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a16 == 1)) || (((((a10 == 1 && 2 <= a3) && a27 == 1) && 1 == a5) && a11 <= 0) && a26 <= 0)) || (((((a27 == 1 && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && a11 == 1) || ((((((a10 == 1 && 1 == a5) && 1 == a3) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 <= 0)) || ((((((a3 <= 0 && a10 == 1) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((a10 == 1 && 1 == a3) && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 <= 0)) || ((((2 <= a3 && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((a3 <= 0 && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 == 1) && a16 == 1)) || ((((((a3 <= 0 && a10 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a11 == 1) && a26 == 1)) || (((((a13 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || ((((1 == a5 && a27 == 1) && !(a12 == 1)) && a26 <= 0) && a11 == 1)) || ((((1 == a5 && !(a12 == 1)) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((a10 == 1 && 2 <= a3) && 1 == a5) && !(1 == a7)) && a11 <= 0) && a26 == 1)) || ((((1 == a3 && 1 == a5) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || (((((1 == a3 && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || ((((((a3 <= 0 && a10 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && a11 == 1)) || ((((a3 <= 0 && 1 == a5) && 1 == a6) && a11 == 1) && a26 == 1)) || ((((1 == a3 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1)) || ((((a3 <= 0 && 1 == a5) && a11 <= 0) && a26 <= 0) && !(1 == a6))) || (((((2 <= a3 && a27 == 1) && 1 == a5) && a11 <= 0) && !(1 == a6)) && a26 <= 0)) || ((((a3 <= 0 && 1 == a5) && a11 <= 0) && a26 <= 0) && a16 == 1)) || (((((2 <= a3 && 1 == a5) && !(a12 == 1)) && !(1 == a6)) && a26 <= 0) && a11 == 1)) || ((((1 == a5 && a27 == 1) && a11 <= 0) && !(a12 == 1)) && a26 <= 0)) || ((((2 <= a3 && 1 == a5) && a11 <= 0) && a26 == 1) && a16 == 1)) || ((((((a10 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && a11 <= 0) && a26 <= 0) && a16 == 1)) || ((((a27 == 1 && 1 == a5) && a12 == 1) && a11 <= 0) && a26 == 1)) || ((((((a13 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a26 <= 0) && a11 == 1) && a16 == 1)) || (((((1 == a3 && 1 == a5) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || ((((1 == a3 && 1 == a5) && 1 == a6) && a11 <= 0) && a26 == 1)) || (((((a10 == 1 && 2 <= a3) && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a26 <= 0)) || ((((((a10 == 1 && 1 == a5) && a27 == 1) && !(a12 == 1)) && a11 <= 0) && !(1 == a6)) && a26 == 1)) || (((((2 <= a3 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1)) || (((((a10 == 1 && 1 == a5) && 1 == a6) && !(a12 == 1)) && a11 <= 0) && a26 == 1)) || ((((1 == a5 && !(a12 == 1)) && a11 <= 0) && a26 == 1) && a16 == 1)) || (((((2 <= a3 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1)) || (((((a10 == 1 && 1 == a5) && a11 == 1) && !(1 == a6)) && a26 == 1) && a16 == 1)) || ((((((a10 == 1 && 1 == a5) && a27 == 1) && 1 == a6) && !(1 == a7)) && a11 == 1) && a16 == 1)) || ((((((2 <= a3 && 1 == a5) && a27 == 1) && !(a12 == 1)) && !(1 == a6)) && a11 == 1) && a26 == 1)) || (((((a10 == 1 && a27 == 1) && 1 == a5) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((2 <= a3 && a27 == 1) && 1 == a5) && a11 <= 0) && a26 == 1)) || (((((1 == a5 && a27 == 1) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a16 == 1)) || (((((a10 == 1 && 2 <= a3) && a27 == 1) && 1 == a5) && a11 <= 0) && a26 <= 0)) || (((((a27 == 1 && 1 == a5) && !(1 == a6)) && a11 == 1) && a26 == 1) && a16 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 30.6s, OverallIterations: 17, TraceHistogramMax: 7, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.3s, HoareTripleCheckerStatistics: 3031 SDtfs, 5702 SDslu, 1478 SDs, 0 SdLazy, 10453 SolverSat, 2075 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1041 GetRequests, 1002 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176566occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 27897 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1559 NumberOfFragments, 1645 HoareAnnotationTreeSize, 3 FomulaSimplifications, 62768 FormulaSimplificationTreeSizeReduction, 7.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 27886 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 5108 NumberOfCodeBlocks, 5108 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5088 ConstructedInterpolants, 0 QuantifiedInterpolants, 2521650 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1793 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 3042/3051 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...