./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/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 29670da151301b8436a6c7ddafad57f5257b4a8d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:42:31,780 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:42:31,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:42:31,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:42:31,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:42:31,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:42:31,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:42:31,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:42:31,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:42:31,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:42:31,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:42:31,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:42:31,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:42:31,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:42:31,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:42:31,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:42:31,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:42:31,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:42:31,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:42:31,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:42:31,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:42:31,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:42:31,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:42:31,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:42:31,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:42:31,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:42:31,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:42:31,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:42:31,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:42:31,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:42:31,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:42:31,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:42:31,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:42:31,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:42:31,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:42:31,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:42:31,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:42:31,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:42:31,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:42:31,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:42:31,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:42:31,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:42:31,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:42:31,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:42:31,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:42:31,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:42:31,878 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:42:31,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:42:31,878 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:42:31,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:42:31,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:42:31,879 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:42:31,880 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:42:31,880 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:42:31,880 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:42:31,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:42:31,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:42:31,881 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:42:31,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:42:31,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:42:31,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:42:31,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:42:31,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:42:31,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:42:31,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:42:31,883 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:42:31,883 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:42:31,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:42:31,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:42:31,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:42:31,884 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_d3f11605-9255-437e-beb5-f4b1833822d0/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 -> 29670da151301b8436a6c7ddafad57f5257b4a8d [2019-11-16 00:42:31,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:42:31,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:42:31,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:42:31,947 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:42:31,948 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:42:31,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2019-11-16 00:42:32,013 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/data/648c3aa5f/18493df88eb0452fa81502d876327a0e/FLAG1be88b8ce [2019-11-16 00:42:32,552 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:42:32,553 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/sv-benchmarks/c/eca-rers2012/Problem01_label25.c [2019-11-16 00:42:32,569 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/data/648c3aa5f/18493df88eb0452fa81502d876327a0e/FLAG1be88b8ce [2019-11-16 00:42:32,805 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/data/648c3aa5f/18493df88eb0452fa81502d876327a0e [2019-11-16 00:42:32,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:42:32,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:42:32,809 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:42:32,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:42:32,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:42:32,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:32" (1/1) ... [2019-11-16 00:42:32,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2648a5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:32, skipping insertion in model container [2019-11-16 00:42:32,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:42:32" (1/1) ... [2019-11-16 00:42:32,822 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:42:32,885 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:42:33,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:42:33,363 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:42:33,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:42:33,506 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:42:33,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33 WrapperNode [2019-11-16 00:42:33,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:42:33,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:42:33,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:42:33,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:42:33,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:42:33,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:42:33,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:42:33,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:42:33,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... [2019-11-16 00:42:33,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:42:33,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:42:33,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:42:33,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:42:33,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/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-16 00:42:33,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:42:33,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:42:34,998 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:42:34,998 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:42:34,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:34 BoogieIcfgContainer [2019-11-16 00:42:35,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:42:35,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:42:35,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:42:35,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:42:35,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:42:32" (1/3) ... [2019-11-16 00:42:35,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e2a572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:35, skipping insertion in model container [2019-11-16 00:42:35,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:42:33" (2/3) ... [2019-11-16 00:42:35,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e2a572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:42:35, skipping insertion in model container [2019-11-16 00:42:35,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:34" (3/3) ... [2019-11-16 00:42:35,008 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label25.c [2019-11-16 00:42:35,018 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:42:35,026 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:42:35,036 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:42:35,078 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:42:35,078 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:42:35,078 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:42:35,079 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:42:35,080 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:42:35,080 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:42:35,080 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:42:35,080 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:42:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-16 00:42:35,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-16 00:42:35,112 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:35,113 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:35,114 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:35,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash -278930290, now seen corresponding path program 1 times [2019-11-16 00:42:35,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:35,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389858210] [2019-11-16 00:42:35,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:35,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:35,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:35,629 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-16 00:42:35,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389858210] [2019-11-16 00:42:35,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:35,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:35,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24136779] [2019-11-16 00:42:35,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:35,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:35,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:35,657 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-16 00:42:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:37,294 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-16 00:42:37,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:42:37,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-16 00:42:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:37,325 INFO L225 Difference]: With dead ends: 662 [2019-11-16 00:42:37,326 INFO L226 Difference]: Without dead ends: 397 [2019-11-16 00:42:37,334 INFO L600 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-16 00:42:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-16 00:42:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-16 00:42:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-16 00:42:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-16 00:42:37,433 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 119 [2019-11-16 00:42:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:37,435 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-16 00:42:37,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-16 00:42:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-16 00:42:37,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:37,446 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:37,447 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash -451650634, now seen corresponding path program 1 times [2019-11-16 00:42:37,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:37,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228333712] [2019-11-16 00:42:37,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:37,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:37,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:37,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228333712] [2019-11-16 00:42:37,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:37,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:37,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276733651] [2019-11-16 00:42:37,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:37,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:37,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:37,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:37,539 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-16 00:42:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:38,225 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-16 00:42:38,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:38,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-16 00:42:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:38,230 INFO L225 Difference]: With dead ends: 1185 [2019-11-16 00:42:38,230 INFO L226 Difference]: Without dead ends: 790 [2019-11-16 00:42:38,232 INFO L600 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-16 00:42:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-16 00:42:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-16 00:42:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-16 00:42:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-16 00:42:38,265 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 124 [2019-11-16 00:42:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:38,266 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-16 00:42:38,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-16 00:42:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-16 00:42:38,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:38,270 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 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-16 00:42:38,270 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:38,271 INFO L82 PathProgramCache]: Analyzing trace with hash 329866697, now seen corresponding path program 1 times [2019-11-16 00:42:38,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:38,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296266973] [2019-11-16 00:42:38,271 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:38,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:38,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-16 00:42:38,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296266973] [2019-11-16 00:42:38,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:38,336 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:42:38,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105145393] [2019-11-16 00:42:38,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:38,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:38,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:38,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:38,337 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-16 00:42:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:38,837 INFO L93 Difference]: Finished difference Result 1971 states and 2688 transitions. [2019-11-16 00:42:38,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:38,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-16 00:42:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:38,845 INFO L225 Difference]: With dead ends: 1971 [2019-11-16 00:42:38,845 INFO L226 Difference]: Without dead ends: 1183 [2019-11-16 00:42:38,849 INFO L600 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-16 00:42:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-16 00:42:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 790. [2019-11-16 00:42:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-16 00:42:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-16 00:42:38,890 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 131 [2019-11-16 00:42:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:38,892 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-16 00:42:38,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-16 00:42:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:42:38,896 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:38,896 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:38,897 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:38,897 INFO L82 PathProgramCache]: Analyzing trace with hash 935317039, now seen corresponding path program 1 times [2019-11-16 00:42:38,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:38,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602246026] [2019-11-16 00:42:38,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:38,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:38,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:39,043 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-16 00:42:39,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602246026] [2019-11-16 00:42:39,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:39,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:39,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493328387] [2019-11-16 00:42:39,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:42:39,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:39,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:42:39,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:42:39,047 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 4 states. [2019-11-16 00:42:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:39,841 INFO L93 Difference]: Finished difference Result 1714 states and 2292 transitions. [2019-11-16 00:42:39,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:42:39,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-16 00:42:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:39,848 INFO L225 Difference]: With dead ends: 1714 [2019-11-16 00:42:39,848 INFO L226 Difference]: Without dead ends: 926 [2019-11-16 00:42:39,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:42:39,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-16 00:42:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 921. [2019-11-16 00:42:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-16 00:42:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1204 transitions. [2019-11-16 00:42:39,884 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1204 transitions. Word has length 134 [2019-11-16 00:42:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:39,884 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1204 transitions. [2019-11-16 00:42:39,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:42:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1204 transitions. [2019-11-16 00:42:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-16 00:42:39,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:39,888 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:42:39,888 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:39,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1288510055, now seen corresponding path program 1 times [2019-11-16 00:42:39,889 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:39,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993663047] [2019-11-16 00:42:39,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:39,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:39,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:40,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993663047] [2019-11-16 00:42:40,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:40,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:42:40,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664709182] [2019-11-16 00:42:40,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:42:40,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:40,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:42:40,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:42:40,011 INFO L87 Difference]: Start difference. First operand 921 states and 1204 transitions. Second operand 5 states. [2019-11-16 00:42:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:41,148 INFO L93 Difference]: Finished difference Result 2233 states and 2968 transitions. [2019-11-16 00:42:41,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:42:41,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-11-16 00:42:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:41,156 INFO L225 Difference]: With dead ends: 2233 [2019-11-16 00:42:41,156 INFO L226 Difference]: Without dead ends: 1445 [2019-11-16 00:42:41,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:42:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-16 00:42:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-16 00:42:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-16 00:42:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1807 transitions. [2019-11-16 00:42:41,202 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1807 transitions. Word has length 138 [2019-11-16 00:42:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:41,203 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1807 transitions. [2019-11-16 00:42:41,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:42:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1807 transitions. [2019-11-16 00:42:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-16 00:42:41,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:41,207 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 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-16 00:42:41,207 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash -965503870, now seen corresponding path program 1 times [2019-11-16 00:42:41,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:41,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128129608] [2019-11-16 00:42:41,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:41,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128129608] [2019-11-16 00:42:41,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:41,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:41,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191918355] [2019-11-16 00:42:41,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:41,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:41,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:41,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:41,264 INFO L87 Difference]: Start difference. First operand 1445 states and 1807 transitions. Second operand 3 states. [2019-11-16 00:42:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:41,828 INFO L93 Difference]: Finished difference Result 3150 states and 3958 transitions. [2019-11-16 00:42:41,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:41,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-16 00:42:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:41,844 INFO L225 Difference]: With dead ends: 3150 [2019-11-16 00:42:41,844 INFO L226 Difference]: Without dead ends: 1707 [2019-11-16 00:42:41,847 INFO L600 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-16 00:42:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-16 00:42:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-16 00:42:41,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-16 00:42:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1666 transitions. [2019-11-16 00:42:41,889 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1666 transitions. Word has length 141 [2019-11-16 00:42:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:41,889 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1666 transitions. [2019-11-16 00:42:41,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1666 transitions. [2019-11-16 00:42:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-16 00:42:41,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:41,894 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:42:41,894 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:41,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash -750696464, now seen corresponding path program 1 times [2019-11-16 00:42:41,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:41,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465091842] [2019-11-16 00:42:41,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:41,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-16 00:42:41,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465091842] [2019-11-16 00:42:41,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:41,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:42:41,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411839777] [2019-11-16 00:42:41,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:41,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:41,965 INFO L87 Difference]: Start difference. First operand 1445 states and 1666 transitions. Second operand 3 states. [2019-11-16 00:42:42,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:42,443 INFO L93 Difference]: Finished difference Result 2888 states and 3328 transitions. [2019-11-16 00:42:42,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:42,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-16 00:42:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:42,451 INFO L225 Difference]: With dead ends: 2888 [2019-11-16 00:42:42,451 INFO L226 Difference]: Without dead ends: 1445 [2019-11-16 00:42:42,453 INFO L600 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-16 00:42:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-16 00:42:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-16 00:42:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-16 00:42:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1594 transitions. [2019-11-16 00:42:42,492 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1594 transitions. Word has length 149 [2019-11-16 00:42:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:42,492 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1594 transitions. [2019-11-16 00:42:42,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1594 transitions. [2019-11-16 00:42:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:42:42,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:42,497 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:42:42,498 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:42,498 INFO L82 PathProgramCache]: Analyzing trace with hash 396028422, now seen corresponding path program 1 times [2019-11-16 00:42:42,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:42,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135976483] [2019-11-16 00:42:42,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:42,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:42,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:42:43,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135976483] [2019-11-16 00:42:43,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:43,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:42:43,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238972949] [2019-11-16 00:42:43,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:42:43,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:43,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:42:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:42:43,305 INFO L87 Difference]: Start difference. First operand 1445 states and 1594 transitions. Second operand 12 states. [2019-11-16 00:42:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:44,785 INFO L93 Difference]: Finished difference Result 3260 states and 3655 transitions. [2019-11-16 00:42:44,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:42:44,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 156 [2019-11-16 00:42:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:44,796 INFO L225 Difference]: With dead ends: 3260 [2019-11-16 00:42:44,796 INFO L226 Difference]: Without dead ends: 1914 [2019-11-16 00:42:44,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:42:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-16 00:42:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2019-11-16 00:42:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-16 00:42:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1909 transitions. [2019-11-16 00:42:44,838 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1909 transitions. Word has length 156 [2019-11-16 00:42:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:44,839 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1909 transitions. [2019-11-16 00:42:44,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:42:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1909 transitions. [2019-11-16 00:42:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-11-16 00:42:44,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:44,845 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:42:44,845 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:44,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:44,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1825782608, now seen corresponding path program 1 times [2019-11-16 00:42:44,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:44,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454396568] [2019-11-16 00:42:44,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:44,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:44,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-16 00:42:45,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454396568] [2019-11-16 00:42:45,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:42:45,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:42:45,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496532775] [2019-11-16 00:42:45,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:45,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:45,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:45,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:42:45,059 INFO L87 Difference]: Start difference. First operand 1742 states and 1909 transitions. Second operand 3 states. [2019-11-16 00:42:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:45,440 INFO L93 Difference]: Finished difference Result 1744 states and 1910 transitions. [2019-11-16 00:42:45,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:45,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-11-16 00:42:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:45,451 INFO L225 Difference]: With dead ends: 1744 [2019-11-16 00:42:45,452 INFO L226 Difference]: Without dead ends: 1742 [2019-11-16 00:42:45,452 INFO L600 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-16 00:42:45,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-11-16 00:42:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2019-11-16 00:42:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-16 00:42:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1907 transitions. [2019-11-16 00:42:45,489 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1907 transitions. Word has length 225 [2019-11-16 00:42:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:45,490 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1907 transitions. [2019-11-16 00:42:45,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1907 transitions. [2019-11-16 00:42:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-16 00:42:45,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:42:45,496 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-16 00:42:45,500 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:42:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:42:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1135581686, now seen corresponding path program 1 times [2019-11-16 00:42:45,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:42:45,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585580906] [2019-11-16 00:42:45,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:45,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:42:45,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:42:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-16 00:42:45,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585580906] [2019-11-16 00:42:45,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757565578] [2019-11-16 00:42:45,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/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-16 00:42:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:42:45,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:42:45,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:42:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-16 00:42:45,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:42:45,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:42:45,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709270104] [2019-11-16 00:42:45,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:42:45,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:42:45,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:42:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:45,961 INFO L87 Difference]: Start difference. First operand 1742 states and 1907 transitions. Second operand 3 states. [2019-11-16 00:42:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:46,433 INFO L93 Difference]: Finished difference Result 1742 states and 1907 transitions. [2019-11-16 00:42:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:42:46,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-11-16 00:42:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:46,434 INFO L225 Difference]: With dead ends: 1742 [2019-11-16 00:42:46,434 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:42:46,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:42:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:42:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:42:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:42:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:42:46,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-11-16 00:42:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:46,437 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:42:46,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:42:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:42:46,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:42:46,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:42:46,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:42:46,848 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-16 00:42:46,848 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-16 00:42:46,848 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,848 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,848 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-16 00:42:46,849 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-16 00:42:46,850 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-16 00:42:46,851 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (not (= ~a16~0 6))) (.cse3 (= ~a21~0 1)) (.cse0 (= 1 ~a7~0)) (.cse1 (<= ~a21~0 0))) (or (and .cse0 .cse1 .cse2) (and (not (= ~a7~0 1)) .cse3) (and .cse2 .cse3) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)))) [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,852 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,853 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,853 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-16 00:42:46,853 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-16 00:42:46,853 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-16 00:42:46,853 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-16 00:42:46,853 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-16 00:42:46,853 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-16 00:42:46,857 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-16 00:42:46,857 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-16 00:42:46,857 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-16 00:42:46,857 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-16 00:42:46,857 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-16 00:42:46,858 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-16 00:42:46,858 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-16 00:42:46,861 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-16 00:42:46,861 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,861 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,861 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,861 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,861 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,861 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-16 00:42:46,862 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-16 00:42:46,862 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-16 00:42:46,862 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-16 00:42:46,862 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-16 00:42:46,862 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-16 00:42:46,862 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-16 00:42:46,862 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-16 00:42:46,862 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-16 00:42:46,863 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,863 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,863 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,863 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,863 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-16 00:42:46,863 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,863 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-16 00:42:46,863 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-16 00:42:46,864 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-16 00:42:46,864 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-16 00:42:46,864 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-16 00:42:46,864 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-16 00:42:46,864 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-16 00:42:46,864 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:42:46,864 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-16 00:42:46,864 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-16 00:42:46,865 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-16 00:42:46,865 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-16 00:42:46,865 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-16 00:42:46,866 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-16 00:42:46,866 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,866 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (not (= ~a16~0 6))) (.cse3 (= ~a21~0 1)) (.cse0 (= 1 ~a7~0)) (.cse1 (<= ~a21~0 0))) (or (and .cse0 .cse1 .cse2) (and (not (= ~a7~0 1)) .cse3) (and .cse2 .cse3) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)))) [2019-11-16 00:42:46,866 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,866 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,866 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,867 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,867 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-16 00:42:46,867 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-16 00:42:46,867 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-16 00:42:46,867 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-16 00:42:46,867 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-16 00:42:46,867 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-16 00:42:46,868 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-16 00:42:46,868 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-16 00:42:46,868 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,868 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,868 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,868 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,868 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,868 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-16 00:42:46,869 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:42:46,869 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-16 00:42:46,869 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-16 00:42:46,869 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-16 00:42:46,869 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-16 00:42:46,869 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-16 00:42:46,869 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-16 00:42:46,869 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-16 00:42:46,870 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-16 00:42:46,870 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-16 00:42:46,870 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-16 00:42:46,870 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-16 00:42:46,870 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,870 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,870 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,870 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,871 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-16 00:42:46,871 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,871 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,871 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-16 00:42:46,871 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-16 00:42:46,871 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:42:46,871 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-16 00:42:46,871 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-16 00:42:46,872 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-16 00:42:46,872 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-16 00:42:46,872 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-16 00:42:46,872 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-16 00:42:46,872 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-16 00:42:46,872 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-16 00:42:46,872 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 533) no Hoare annotation was computed. [2019-11-16 00:42:46,873 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-16 00:42:46,873 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-16 00:42:46,873 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,873 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,873 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,873 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,873 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,873 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-16 00:42:46,874 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,874 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-16 00:42:46,874 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-16 00:42:46,874 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-16 00:42:46,874 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-16 00:42:46,874 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-16 00:42:46,874 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-16 00:42:46,874 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-16 00:42:46,875 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-16 00:42:46,875 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-16 00:42:46,875 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-16 00:42:46,875 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-16 00:42:46,875 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:42:46,875 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-16 00:42:46,875 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-16 00:42:46,876 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-16 00:42:46,876 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,876 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,876 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,876 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,876 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,876 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:42:46,876 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-16 00:42:46,877 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-16 00:42:46,877 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-16 00:42:46,877 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-16 00:42:46,877 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-16 00:42:46,877 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-16 00:42:46,877 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-16 00:42:46,877 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-16 00:42:46,877 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-16 00:42:46,878 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-16 00:42:46,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:42:46 BoogieIcfgContainer [2019-11-16 00:42:46,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:42:46,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:42:46,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:42:46,903 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:42:46,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:42:34" (3/4) ... [2019-11-16 00:42:46,907 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:42:46,941 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:42:46,942 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:42:47,130 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d3f11605-9255-437e-beb5-f4b1833822d0/bin/uautomizer/witness.graphml [2019-11-16 00:42:47,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:42:47,132 INFO L168 Benchmark]: Toolchain (without parser) took 14323.34 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 401.1 MB). Free memory was 944.7 MB in the beginning and 884.0 MB in the end (delta: 60.7 MB). Peak memory consumption was 461.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:47,133 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-16 00:42:47,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:47,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:47,134 INFO L168 Benchmark]: Boogie Preprocessor took 107.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:47,135 INFO L168 Benchmark]: RCFGBuilder took 1279.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 966.6 MB in the end (delta: 105.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:47,136 INFO L168 Benchmark]: TraceAbstraction took 11901.60 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 283.1 MB). Free memory was 966.6 MB in the beginning and 912.3 MB in the end (delta: 54.2 MB). Peak memory consumption was 337.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:47,136 INFO L168 Benchmark]: Witness Printer took 227.50 ms. Allocated memory is still 1.4 GB. Free memory was 912.3 MB in the beginning and 884.0 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:47,138 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.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 698.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -134.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1279.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 966.6 MB in the end (delta: 105.4 MB). Peak memory consumption was 105.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11901.60 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 283.1 MB). Free memory was 966.6 MB in the beginning and 912.3 MB in the end (delta: 54.2 MB). Peak memory consumption was 337.4 MB. Max. memory is 11.5 GB. * Witness Printer took 227.50 ms. Allocated memory is still 1.4 GB. Free memory was 912.3 MB in the beginning and 884.0 MB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: 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: 30]: Loop Invariant Derived loop invariant: ((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (!(a7 == 1) && a21 == 1)) || (!(a16 == 6) && a21 == 1)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (!(a7 == 1) && a21 == 1)) || (!(a16 == 6) && a21 == 1)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.8s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 727 SDtfs, 2078 SDslu, 122 SDs, 0 SdLazy, 5451 SolverSat, 683 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred 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, 832 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 38 NumberOfFragments, 83 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1952 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1797 NumberOfCodeBlocks, 1797 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1786 ConstructedInterpolants, 0 QuantifiedInterpolants, 1060078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 882/909 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...