./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label42.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label42.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/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 a8726e54e507f4e5407a6f1ab8a73f56b359228a .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:58:15,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:58:15,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:58:15,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:58:15,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:58:15,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:58:15,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:58:15,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:58:15,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:58:15,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:58:15,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:58:15,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:58:15,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:58:15,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:58:15,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:58:15,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:58:15,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:58:15,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:58:15,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:58:15,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:58:15,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:58:15,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:58:15,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:58:15,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:58:15,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:58:15,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:58:15,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:58:15,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:58:15,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:58:15,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:58:15,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:58:15,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:58:15,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:58:15,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:58:15,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:58:15,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:58:15,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:58:15,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:58:15,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:58:15,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:58:15,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:58:15,700 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:58:15,712 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:58:15,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:58:15,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:58:15,714 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:58:15,714 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:58:15,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:58:15,715 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:58:15,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:58:15,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:58:15,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:58:15,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:58:15,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:58:15,716 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:58:15,716 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:58:15,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:58:15,716 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:58:15,717 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:58:15,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:58:15,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:58:15,717 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:58:15,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:58:15,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:58:15,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:58:15,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:58:15,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:58:15,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:58:15,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:58:15,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:58:15,719 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_c71212c2-0856-4a03-a73a-404cdfbfd160/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 -> a8726e54e507f4e5407a6f1ab8a73f56b359228a [2019-11-25 08:58:15,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:58:15,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:58:15,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:58:15,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:58:15,878 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:58:15,879 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label42.c [2019-11-25 08:58:15,938 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/data/59a924027/d981e8cec26947e6ab507deed65a2a06/FLAGa940f080a [2019-11-25 08:58:16,364 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:58:16,365 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/sv-benchmarks/c/eca-rers2012/Problem02_label42.c [2019-11-25 08:58:16,378 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/data/59a924027/d981e8cec26947e6ab507deed65a2a06/FLAGa940f080a [2019-11-25 08:58:16,736 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/data/59a924027/d981e8cec26947e6ab507deed65a2a06 [2019-11-25 08:58:16,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:58:16,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:58:16,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:58:16,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:58:16,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:58:16,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:58:16" (1/1) ... [2019-11-25 08:58:16,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54728782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:16, skipping insertion in model container [2019-11-25 08:58:16,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:58:16" (1/1) ... [2019-11-25 08:58:16,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:58:16,810 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:58:17,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:58:17,246 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:58:17,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:58:17,410 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:58:17,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17 WrapperNode [2019-11-25 08:58:17,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:58:17,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:58:17,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:58:17,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:58:17,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:58:17,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:58:17,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:58:17,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:58:17,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... [2019-11-25 08:58:17,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:58:17,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:58:17,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:58:17,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:58:17,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/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-11-25 08:58:17,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:58:17,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:58:18,731 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:58:18,732 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:58:18,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:18 BoogieIcfgContainer [2019-11-25 08:58:18,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:58:18,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:58:18,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:58:18,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:58:18,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:58:16" (1/3) ... [2019-11-25 08:58:18,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4487389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:58:18, skipping insertion in model container [2019-11-25 08:58:18,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:58:17" (2/3) ... [2019-11-25 08:58:18,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4487389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:58:18, skipping insertion in model container [2019-11-25 08:58:18,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:18" (3/3) ... [2019-11-25 08:58:18,744 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label42.c [2019-11-25 08:58:18,752 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:58:18,758 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:58:18,768 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:58:18,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:58:18,791 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:58:18,791 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:58:18,791 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:58:18,791 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:58:18,792 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:58:18,792 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:58:18,792 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:58:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-25 08:58:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:58:18,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:18,830 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] [2019-11-25 08:58:18,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:18,835 INFO L82 PathProgramCache]: Analyzing trace with hash 499493077, now seen corresponding path program 1 times [2019-11-25 08:58:18,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:18,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027596083] [2019-11-25 08:58:18,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:19,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027596083] [2019-11-25 08:58:19,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:19,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:19,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747409854] [2019-11-25 08:58:19,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:19,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:19,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:19,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:19,286 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-25 08:58:20,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:20,669 INFO L93 Difference]: Finished difference Result 748 states and 1324 transitions. [2019-11-25 08:58:20,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:20,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-25 08:58:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:20,695 INFO L225 Difference]: With dead ends: 748 [2019-11-25 08:58:20,696 INFO L226 Difference]: Without dead ends: 454 [2019-11-25 08:58:20,703 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-11-25 08:58:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-25 08:58:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2019-11-25 08:58:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-11-25 08:58:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 616 transitions. [2019-11-25 08:58:20,775 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 616 transitions. Word has length 100 [2019-11-25 08:58:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:20,776 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 616 transitions. [2019-11-25 08:58:20,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 616 transitions. [2019-11-25 08:58:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-25 08:58:20,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:20,783 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:58:20,783 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:20,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash 396760741, now seen corresponding path program 1 times [2019-11-25 08:58:20,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:20,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592828659] [2019-11-25 08:58:20,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:20,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592828659] [2019-11-25 08:58:20,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:20,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:58:20,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076153728] [2019-11-25 08:58:20,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:20,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:20,858 INFO L87 Difference]: Start difference. First operand 451 states and 616 transitions. Second operand 3 states. [2019-11-25 08:58:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:21,424 INFO L93 Difference]: Finished difference Result 1323 states and 1809 transitions. [2019-11-25 08:58:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:21,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-25 08:58:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:21,429 INFO L225 Difference]: With dead ends: 1323 [2019-11-25 08:58:21,429 INFO L226 Difference]: Without dead ends: 874 [2019-11-25 08:58:21,431 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-11-25 08:58:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-11-25 08:58:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-11-25 08:58:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-11-25 08:58:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1139 transitions. [2019-11-25 08:58:21,462 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1139 transitions. Word has length 117 [2019-11-25 08:58:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:21,463 INFO L462 AbstractCegarLoop]: Abstraction has 874 states and 1139 transitions. [2019-11-25 08:58:21,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1139 transitions. [2019-11-25 08:58:21,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-25 08:58:21,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:21,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-25 08:58:21,473 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:21,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1844290899, now seen corresponding path program 1 times [2019-11-25 08:58:21,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:21,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215455610] [2019-11-25 08:58:21,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:58:21,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215455610] [2019-11-25 08:58:21,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:21,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:21,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621866012] [2019-11-25 08:58:21,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:21,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:21,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:21,657 INFO L87 Difference]: Start difference. First operand 874 states and 1139 transitions. Second operand 4 states. [2019-11-25 08:58:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:22,204 INFO L93 Difference]: Finished difference Result 2154 states and 2796 transitions. [2019-11-25 08:58:22,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:22,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-25 08:58:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:22,211 INFO L225 Difference]: With dead ends: 2154 [2019-11-25 08:58:22,211 INFO L226 Difference]: Without dead ends: 1282 [2019-11-25 08:58:22,213 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-11-25 08:58:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-11-25 08:58:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 862. [2019-11-25 08:58:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-11-25 08:58:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1063 transitions. [2019-11-25 08:58:22,235 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1063 transitions. Word has length 133 [2019-11-25 08:58:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:22,236 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1063 transitions. [2019-11-25 08:58:22,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:22,236 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1063 transitions. [2019-11-25 08:58:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-25 08:58:22,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:22,240 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-25 08:58:22,240 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1961644753, now seen corresponding path program 1 times [2019-11-25 08:58:22,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:22,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554726150] [2019-11-25 08:58:22,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-25 08:58:22,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554726150] [2019-11-25 08:58:22,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:22,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:22,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88597843] [2019-11-25 08:58:22,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:22,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:22,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:22,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:22,304 INFO L87 Difference]: Start difference. First operand 862 states and 1063 transitions. Second operand 3 states. [2019-11-25 08:58:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:22,832 INFO L93 Difference]: Finished difference Result 2286 states and 2790 transitions. [2019-11-25 08:58:22,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:22,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-11-25 08:58:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:22,839 INFO L225 Difference]: With dead ends: 2286 [2019-11-25 08:58:22,839 INFO L226 Difference]: Without dead ends: 1426 [2019-11-25 08:58:22,842 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-11-25 08:58:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2019-11-25 08:58:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1143. [2019-11-25 08:58:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2019-11-25 08:58:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1399 transitions. [2019-11-25 08:58:22,876 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1399 transitions. Word has length 139 [2019-11-25 08:58:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:22,876 INFO L462 AbstractCegarLoop]: Abstraction has 1143 states and 1399 transitions. [2019-11-25 08:58:22,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1399 transitions. [2019-11-25 08:58:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-25 08:58:22,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:22,879 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:58:22,880 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:22,881 INFO L82 PathProgramCache]: Analyzing trace with hash -435160690, now seen corresponding path program 1 times [2019-11-25 08:58:22,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:22,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98827879] [2019-11-25 08:58:22,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-25 08:58:22,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98827879] [2019-11-25 08:58:22,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:22,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:22,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184192749] [2019-11-25 08:58:22,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:22,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:22,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:22,987 INFO L87 Difference]: Start difference. First operand 1143 states and 1399 transitions. Second operand 3 states. [2019-11-25 08:58:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:23,438 INFO L93 Difference]: Finished difference Result 2566 states and 3148 transitions. [2019-11-25 08:58:23,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:23,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-11-25 08:58:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:23,449 INFO L225 Difference]: With dead ends: 2566 [2019-11-25 08:58:23,449 INFO L226 Difference]: Without dead ends: 1425 [2019-11-25 08:58:23,451 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-11-25 08:58:23,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2019-11-25 08:58:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1423. [2019-11-25 08:58:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-11-25 08:58:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1704 transitions. [2019-11-25 08:58:23,484 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1704 transitions. Word has length 144 [2019-11-25 08:58:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:23,485 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 1704 transitions. [2019-11-25 08:58:23,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1704 transitions. [2019-11-25 08:58:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-25 08:58:23,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:23,489 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:23,489 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash -266021720, now seen corresponding path program 1 times [2019-11-25 08:58:23,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:23,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373428831] [2019-11-25 08:58:23,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:58:23,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373428831] [2019-11-25 08:58:23,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:23,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:58:23,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962172804] [2019-11-25 08:58:23,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:58:23,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:23,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:58:23,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:58:23,585 INFO L87 Difference]: Start difference. First operand 1423 states and 1704 transitions. Second operand 4 states. [2019-11-25 08:58:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:24,293 INFO L93 Difference]: Finished difference Result 3404 states and 4091 transitions. [2019-11-25 08:58:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:58:24,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-11-25 08:58:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:24,304 INFO L225 Difference]: With dead ends: 3404 [2019-11-25 08:58:24,304 INFO L226 Difference]: Without dead ends: 1700 [2019-11-25 08:58:24,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-25 08:58:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-11-25 08:58:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1560. [2019-11-25 08:58:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-11-25 08:58:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1725 transitions. [2019-11-25 08:58:24,337 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1725 transitions. Word has length 146 [2019-11-25 08:58:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:24,337 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 1725 transitions. [2019-11-25 08:58:24,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:58:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1725 transitions. [2019-11-25 08:58:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-25 08:58:24,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:24,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:24,341 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:24,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1950870258, now seen corresponding path program 1 times [2019-11-25 08:58:24,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:24,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656084309] [2019-11-25 08:58:24,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 62 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:58:24,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656084309] [2019-11-25 08:58:24,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475608143] [2019-11-25 08:58:24,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/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-11-25 08:58:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:24,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:58:24,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:58:24,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:58:24,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-25 08:58:24,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734267079] [2019-11-25 08:58:24,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:24,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:24,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:58:24,656 INFO L87 Difference]: Start difference. First operand 1560 states and 1725 transitions. Second operand 3 states. [2019-11-25 08:58:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:24,989 INFO L93 Difference]: Finished difference Result 3397 states and 3747 transitions. [2019-11-25 08:58:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:24,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-25 08:58:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:24,996 INFO L225 Difference]: With dead ends: 3397 [2019-11-25 08:58:24,997 INFO L226 Difference]: Without dead ends: 1697 [2019-11-25 08:58:24,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:58:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2019-11-25 08:58:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1695. [2019-11-25 08:58:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states. [2019-11-25 08:58:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 1803 transitions. [2019-11-25 08:58:25,030 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 1803 transitions. Word has length 150 [2019-11-25 08:58:25,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:25,031 INFO L462 AbstractCegarLoop]: Abstraction has 1695 states and 1803 transitions. [2019-11-25 08:58:25,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 1803 transitions. [2019-11-25 08:58:25,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-25 08:58:25,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:25,035 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:58:25,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:25,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1731681118, now seen corresponding path program 1 times [2019-11-25 08:58:25,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:25,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153496644] [2019-11-25 08:58:25,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 78 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-25 08:58:25,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153496644] [2019-11-25 08:58:25,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495018303] [2019-11-25 08:58:25,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/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-11-25 08:58:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:25,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:58:25,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:58:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-25 08:58:25,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:58:25,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-11-25 08:58:25,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137295136] [2019-11-25 08:58:25,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:25,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:25,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:25,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:58:25,615 INFO L87 Difference]: Start difference. First operand 1695 states and 1803 transitions. Second operand 3 states. [2019-11-25 08:58:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:26,036 INFO L93 Difference]: Finished difference Result 4518 states and 4819 transitions. [2019-11-25 08:58:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:26,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-11-25 08:58:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:26,048 INFO L225 Difference]: With dead ends: 4518 [2019-11-25 08:58:26,049 INFO L226 Difference]: Without dead ends: 2965 [2019-11-25 08:58:26,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:58:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-11-25 08:58:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2965. [2019-11-25 08:58:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2019-11-25 08:58:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3160 transitions. [2019-11-25 08:58:26,109 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3160 transitions. Word has length 168 [2019-11-25 08:58:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:26,109 INFO L462 AbstractCegarLoop]: Abstraction has 2965 states and 3160 transitions. [2019-11-25 08:58:26,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3160 transitions. [2019-11-25 08:58:26,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-25 08:58:26,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:26,115 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-25 08:58:26,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:58:26,319 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1863728915, now seen corresponding path program 1 times [2019-11-25 08:58:26,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:26,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158863162] [2019-11-25 08:58:26,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-25 08:58:26,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158863162] [2019-11-25 08:58:26,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:26,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:26,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842781617] [2019-11-25 08:58:26,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:26,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:26,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:26,386 INFO L87 Difference]: Start difference. First operand 2965 states and 3160 transitions. Second operand 3 states. [2019-11-25 08:58:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:26,833 INFO L93 Difference]: Finished difference Result 4660 states and 4962 transitions. [2019-11-25 08:58:26,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:26,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-25 08:58:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:26,846 INFO L225 Difference]: With dead ends: 4660 [2019-11-25 08:58:26,846 INFO L226 Difference]: Without dead ends: 2965 [2019-11-25 08:58:26,849 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-11-25 08:58:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2019-11-25 08:58:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2825. [2019-11-25 08:58:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2019-11-25 08:58:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3011 transitions. [2019-11-25 08:58:26,901 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3011 transitions. Word has length 172 [2019-11-25 08:58:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:26,902 INFO L462 AbstractCegarLoop]: Abstraction has 2825 states and 3011 transitions. [2019-11-25 08:58:26,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3011 transitions. [2019-11-25 08:58:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-25 08:58:26,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:58:26,909 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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, 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] [2019-11-25 08:58:26,909 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:58:26,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:58:26,910 INFO L82 PathProgramCache]: Analyzing trace with hash 927349297, now seen corresponding path program 1 times [2019-11-25 08:58:26,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:58:26,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004554688] [2019-11-25 08:58:26,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:58:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:58:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-25 08:58:26,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004554688] [2019-11-25 08:58:26,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:58:26,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:58:26,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739451927] [2019-11-25 08:58:26,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:58:26,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:58:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:58:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:58:26,999 INFO L87 Difference]: Start difference. First operand 2825 states and 3011 transitions. Second operand 3 states. [2019-11-25 08:58:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:58:27,414 INFO L93 Difference]: Finished difference Result 3665 states and 3891 transitions. [2019-11-25 08:58:27,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:58:27,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-25 08:58:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:58:27,415 INFO L225 Difference]: With dead ends: 3665 [2019-11-25 08:58:27,415 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:58:27,418 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-11-25 08:58:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:58:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:58:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:58:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:58:27,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2019-11-25 08:58:27,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:58:27,419 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:58:27,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:58:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:58:27,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:58:27,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:58:27,828 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-11-25 08:58:28,124 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-11-25 08:58:28,127 INFO L444 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,127 INFO L444 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,127 INFO L444 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,127 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-25 08:58:28,127 INFO L444 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-25 08:58:28,127 INFO L444 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-25 08:58:28,128 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,129 INFO L444 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-25 08:58:28,130 INFO L444 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-25 08:58:28,131 INFO L444 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-25 08:58:28,132 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-25 08:58:28,133 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,134 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 472) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-25 08:58:28,135 INFO L444 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,136 INFO L444 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,136 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-25 08:58:28,141 INFO L444 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-25 08:58:28,142 INFO L444 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-25 08:58:28,142 INFO L444 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-25 08:58:28,142 INFO L444 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-25 08:58:28,142 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-25 08:58:28,142 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-25 08:58:28,142 INFO L444 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-25 08:58:28,143 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-25 08:58:28,144 INFO L440 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse9 (= ~a25~0 1))) (let ((.cse10 (not .cse9)) (.cse1 (= ~a28~0 7)) (.cse0 (= ~a17~0 8)) (.cse2 (<= ~a11~0 0)) (.cse8 (not (= ~a28~0 11))) (.cse7 (= ~a11~0 1)) (.cse3 (= ~a28~0 10)) (.cse4 (not (= ~a28~0 8))) (.cse6 (= ~a19~0 1)) (.cse5 (not (= ~a17~0 9)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse4 .cse6 .cse7 .cse5 .cse8) (and .cse4 .cse9 .cse7 .cse5 .cse8) (and .cse0 .cse1 .cse7) (and .cse10 .cse4 .cse2 .cse5 .cse8) (and .cse10 .cse0 .cse2 .cse8) (and .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse8) (and .cse4 .cse6 .cse2 .cse5 .cse8) (and .cse3 .cse4 .cse7 .cse5) (and (<= 11 ~a28~0) .cse4 .cse6 .cse9 .cse5) (and .cse3 .cse4 .cse6 .cse5)))) [2019-11-25 08:58:28,144 INFO L444 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,145 INFO L444 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,145 INFO L444 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-25 08:58:28,145 INFO L444 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-25 08:58:28,145 INFO L444 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-25 08:58:28,145 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-25 08:58:28,145 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-25 08:58:28,145 INFO L444 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-25 08:58:28,145 INFO L447 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-25 08:58:28,146 INFO L444 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,146 INFO L444 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,146 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-25 08:58:28,146 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-25 08:58:28,146 INFO L444 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-25 08:58:28,146 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-25 08:58:28,146 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-25 08:58:28,147 INFO L444 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-25 08:58:28,147 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-25 08:58:28,147 INFO L444 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-25 08:58:28,147 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-25 08:58:28,147 INFO L444 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,147 INFO L444 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,147 INFO L444 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-25 08:58:28,147 INFO L444 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-25 08:58:28,148 INFO L444 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-25 08:58:28,148 INFO L444 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-25 08:58:28,148 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-25 08:58:28,148 INFO L444 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-25 08:58:28,148 INFO L440 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse9 (= ~a25~0 1))) (let ((.cse10 (not .cse9)) (.cse1 (= ~a28~0 7)) (.cse0 (= ~a17~0 8)) (.cse2 (<= ~a11~0 0)) (.cse8 (not (= ~a28~0 11))) (.cse7 (= ~a11~0 1)) (.cse3 (= ~a28~0 10)) (.cse4 (not (= ~a28~0 8))) (.cse6 (= ~a19~0 1)) (.cse5 (not (= ~a17~0 9)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2 .cse5) (and .cse4 .cse6 .cse7 .cse5 .cse8) (and .cse4 .cse9 .cse7 .cse5 .cse8) (and .cse0 .cse1 .cse7) (and .cse10 .cse4 .cse2 .cse5 .cse8) (and .cse10 .cse0 .cse2 .cse8) (and .cse6 .cse1 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse8) (and .cse4 .cse6 .cse2 .cse5 .cse8) (and .cse3 .cse4 .cse7 .cse5) (and (<= 11 ~a28~0) .cse4 .cse6 .cse9 .cse5) (and .cse3 .cse4 .cse6 .cse5)))) [2019-11-25 08:58:28,148 INFO L444 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,149 INFO L444 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,149 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-25 08:58:28,149 INFO L444 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-25 08:58:28,149 INFO L444 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-25 08:58:28,149 INFO L444 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-25 08:58:28,149 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-25 08:58:28,149 INFO L444 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,149 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,150 INFO L444 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-25 08:58:28,150 INFO L444 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-25 08:58:28,150 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-25 08:58:28,150 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-25 08:58:28,150 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-25 08:58:28,150 INFO L444 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-25 08:58:28,150 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-25 08:58:28,151 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-25 08:58:28,151 INFO L444 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-25 08:58:28,151 INFO L444 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,151 INFO L444 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,151 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-25 08:58:28,151 INFO L444 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,151 INFO L444 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-25 08:58:28,151 INFO L444 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-25 08:58:28,152 INFO L444 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-25 08:58:28,152 INFO L444 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-25 08:58:28,152 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-25 08:58:28,152 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:58:28,152 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-25 08:58:28,152 INFO L444 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,152 INFO L444 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,152 INFO L444 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,153 INFO L444 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-25 08:58:28,153 INFO L444 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-25 08:58:28,153 INFO L444 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-25 08:58:28,153 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-25 08:58:28,153 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-25 08:58:28,153 INFO L444 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,153 INFO L444 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,154 INFO L444 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,154 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-25 08:58:28,154 INFO L444 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-25 08:58:28,154 INFO L444 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-25 08:58:28,154 INFO L444 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-25 08:58:28,154 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-25 08:58:28,154 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-25 08:58:28,154 INFO L444 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,155 INFO L444 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,155 INFO L444 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,155 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-25 08:58:28,155 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-25 08:58:28,155 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-25 08:58:28,155 INFO L444 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-25 08:58:28,155 INFO L444 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-25 08:58:28,155 INFO L444 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-25 08:58:28,156 INFO L444 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-25 08:58:28,157 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-25 08:58:28,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:58:28 BoogieIcfgContainer [2019-11-25 08:58:28,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:58:28,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:58:28,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:58:28,190 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:58:28,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:58:18" (3/4) ... [2019-11-25 08:58:28,194 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:58:28,220 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:58:28,229 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:58:28,404 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c71212c2-0856-4a03-a73a-404cdfbfd160/bin/uautomizer/witness.graphml [2019-11-25 08:58:28,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:58:28,405 INFO L168 Benchmark]: Toolchain (without parser) took 11666.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.3 MB). Free memory was 944.7 MB in the beginning and 926.3 MB in the end (delta: 18.4 MB). Peak memory consumption was 284.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:28,405 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:58:28,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:28,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:28,407 INFO L168 Benchmark]: Boogie Preprocessor took 57.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:28,407 INFO L168 Benchmark]: RCFGBuilder took 1179.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:28,407 INFO L168 Benchmark]: TraceAbstraction took 9444.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.1 MB). Free memory was 1.0 GB in the beginning and 944.5 MB in the end (delta: 63.4 MB). Peak memory consumption was 173.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:28,408 INFO L168 Benchmark]: Witness Printer took 225.14 ms. Allocated memory is still 1.3 GB. Free memory was 944.5 MB in the beginning and 926.3 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:58:28,410 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1179.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9444.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.1 MB). Free memory was 1.0 GB in the beginning and 944.5 MB in the end (delta: 63.4 MB). Peak memory consumption was 173.5 MB. Max. memory is 11.5 GB. * Witness Printer took 225.14 ms. Allocated memory is still 1.3 GB. Free memory was 944.5 MB in the beginning and 926.3 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 472]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: (((((((((((((a17 == 8 && a28 == 7) && a11 <= 0) || (((a28 == 10 && !(a28 == 8)) && a11 <= 0) && !(a17 == 9))) || ((((!(a28 == 8) && a19 == 1) && a11 == 1) && !(a17 == 9)) && !(a28 == 11))) || ((((!(a28 == 8) && a25 == 1) && a11 == 1) && !(a17 == 9)) && !(a28 == 11))) || ((a17 == 8 && a28 == 7) && a11 == 1)) || ((((!(a25 == 1) && !(a28 == 8)) && a11 <= 0) && !(a17 == 9)) && !(a28 == 11))) || (((!(a25 == 1) && a17 == 8) && a11 <= 0) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && !(a17 == 9))) || (((a17 == 8 && a19 == 1) && a11 <= 0) && !(a28 == 11))) || ((((!(a28 == 8) && a19 == 1) && a11 <= 0) && !(a17 == 9)) && !(a28 == 11))) || (((a28 == 10 && !(a28 == 8)) && a11 == 1) && !(a17 == 9))) || ((((11 <= a28 && !(a28 == 8)) && a19 == 1) && a25 == 1) && !(a17 == 9))) || (((a28 == 10 && !(a28 == 8)) && a19 == 1) && !(a17 == 9)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((a17 == 8 && a28 == 7) && a11 <= 0) || (((a28 == 10 && !(a28 == 8)) && a11 <= 0) && !(a17 == 9))) || ((((!(a28 == 8) && a19 == 1) && a11 == 1) && !(a17 == 9)) && !(a28 == 11))) || ((((!(a28 == 8) && a25 == 1) && a11 == 1) && !(a17 == 9)) && !(a28 == 11))) || ((a17 == 8 && a28 == 7) && a11 == 1)) || ((((!(a25 == 1) && !(a28 == 8)) && a11 <= 0) && !(a17 == 9)) && !(a28 == 11))) || (((!(a25 == 1) && a17 == 8) && a11 <= 0) && !(a28 == 11))) || (((a19 == 1 && a28 == 7) && a25 == 1) && !(a17 == 9))) || (((a17 == 8 && a19 == 1) && a11 <= 0) && !(a28 == 11))) || ((((!(a28 == 8) && a19 == 1) && a11 <= 0) && !(a17 == 9)) && !(a28 == 11))) || (((a28 == 10 && !(a28 == 8)) && a11 == 1) && !(a17 == 9))) || ((((11 <= a28 && !(a28 == 8)) && a19 == 1) && a25 == 1) && !(a17 == 9))) || (((a28 == 10 && !(a28 == 8)) && a19 == 1) && !(a17 == 9)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 9.3s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 1065 SDtfs, 1945 SDslu, 163 SDs, 0 SdLazy, 3995 SolverSat, 768 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2965occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 990 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 409 HoareAnnotationTreeSize, 3 FomulaSimplifications, 226 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 870 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1780 NumberOfCodeBlocks, 1780 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 536707 SizeOfPredicates, 1 NumberOfNonLiveVariables, 580 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 853/855 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...