./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label09.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_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/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 31179e70784aebb46d762aef4da1a2ff63bbff38 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:12:50,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:12:50,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:12:50,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:12:50,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:12:50,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:12:50,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:12:50,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:12:50,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:12:50,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:12:50,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:12:50,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:12:50,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:12:50,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:12:50,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:12:50,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:12:50,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:12:50,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:12:50,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:12:50,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:12:50,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:12:50,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:12:50,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:12:50,888 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:12:50,890 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:12:50,890 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:12:50,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:12:50,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:12:50,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:12:50,893 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:12:50,893 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:12:50,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:12:50,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:12:50,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:12:50,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:12:50,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:12:50,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:12:50,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:12:50,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:12:50,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:12:50,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:12:50,899 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:12:50,912 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:12:50,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:12:50,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:12:50,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:12:50,914 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:12:50,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:12:50,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:12:50,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:12:50,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:12:50,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:12:50,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:12:50,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:12:50,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:12:50,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:12:50,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:12:50,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:12:50,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:12:50,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:12:50,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:12:50,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:12:50,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:12:50,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:12:50,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:12:50,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:12:50,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:12:50,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:12:50,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:12:50,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:12:50,920 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_f3880260-1a21-4017-a007-f0e70709f82a/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 -> 31179e70784aebb46d762aef4da1a2ff63bbff38 [2019-11-15 20:12:50,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:12:50,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:12:50,966 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:12:50,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:12:50,968 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:12:50,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2019-11-15 20:12:51,026 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/data/11ea10c26/d15e38f6b7994832be89a076f85742bc/FLAGcea7fa00e [2019-11-15 20:12:51,487 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:12:51,488 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2019-11-15 20:12:51,498 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/data/11ea10c26/d15e38f6b7994832be89a076f85742bc/FLAGcea7fa00e [2019-11-15 20:12:51,815 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/data/11ea10c26/d15e38f6b7994832be89a076f85742bc [2019-11-15 20:12:51,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:12:51,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:12:51,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:12:51,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:12:51,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:12:51,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:12:51" (1/1) ... [2019-11-15 20:12:51,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@791d7c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:51, skipping insertion in model container [2019-11-15 20:12:51,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:12:51" (1/1) ... [2019-11-15 20:12:51,831 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:12:51,880 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:12:52,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:12:52,283 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:12:52,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:12:52,405 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:12:52,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52 WrapperNode [2019-11-15 20:12:52,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:12:52,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:12:52,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:12:52,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:12:52,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:12:52,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:12:52,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:12:52,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:12:52,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... [2019-11-15 20:12:52,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:12:52,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:12:52,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:12:52,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:12:52,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/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-15 20:12:52,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:12:52,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:12:53,875 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:12:53,875 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:12:53,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:53 BoogieIcfgContainer [2019-11-15 20:12:53,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:12:53,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:12:53,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:12:53,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:12:53,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:12:51" (1/3) ... [2019-11-15 20:12:53,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1969d9b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:12:53, skipping insertion in model container [2019-11-15 20:12:53,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:12:52" (2/3) ... [2019-11-15 20:12:53,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1969d9b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:12:53, skipping insertion in model container [2019-11-15 20:12:53,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:53" (3/3) ... [2019-11-15 20:12:53,886 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label09.c [2019-11-15 20:12:53,895 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:12:53,904 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:12:53,914 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:12:53,955 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:12:53,955 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:12:53,955 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:12:53,955 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:12:53,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:12:53,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:12:53,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:12:53,956 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:12:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-15 20:12:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 20:12:53,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:53,999 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] [2019-11-15 20:12:54,001 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:54,007 INFO L82 PathProgramCache]: Analyzing trace with hash -286092569, now seen corresponding path program 1 times [2019-11-15 20:12:54,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:54,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775807531] [2019-11-15 20:12:54,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:54,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:54,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:54,494 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-15 20:12:54,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775807531] [2019-11-15 20:12:54,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:54,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:12:54,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233339489] [2019-11-15 20:12:54,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:54,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:54,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:54,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:54,516 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-15 20:12:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:55,938 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-11-15 20:12:55,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:12:55,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-15 20:12:55,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:55,955 INFO L225 Difference]: With dead ends: 687 [2019-11-15 20:12:55,956 INFO L226 Difference]: Without dead ends: 397 [2019-11-15 20:12:55,960 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-15 20:12:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-15 20:12:56,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-15 20:12:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-15 20:12:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-15 20:12:56,046 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 118 [2019-11-15 20:12:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:56,046 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-15 20:12:56,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:12:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-15 20:12:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 20:12:56,050 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:56,050 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:56,050 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:56,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:56,051 INFO L82 PathProgramCache]: Analyzing trace with hash 520774714, now seen corresponding path program 1 times [2019-11-15 20:12:56,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:56,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922981615] [2019-11-15 20:12:56,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:56,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:56,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:12:56,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922981615] [2019-11-15 20:12:56,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:56,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:12:56,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394958429] [2019-11-15 20:12:56,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:56,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:56,164 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-15 20:12:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:56,939 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-15 20:12:56,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:12:56,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-15 20:12:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:56,945 INFO L225 Difference]: With dead ends: 1054 [2019-11-15 20:12:56,945 INFO L226 Difference]: Without dead ends: 790 [2019-11-15 20:12:56,947 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-15 20:12:56,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-15 20:12:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-15 20:12:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-15 20:12:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-15 20:12:56,991 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 124 [2019-11-15 20:12:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:56,991 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-15 20:12:56,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:12:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-15 20:12:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 20:12:56,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:56,998 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:56,999 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1772838714, now seen corresponding path program 1 times [2019-11-15 20:12:56,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:57,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288940546] [2019-11-15 20:12:57,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:57,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:57,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:12:57,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288940546] [2019-11-15 20:12:57,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:57,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:12:57,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393982327] [2019-11-15 20:12:57,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:12:57,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:12:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:12:57,124 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 3 states. [2019-11-15 20:12:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:57,643 INFO L93 Difference]: Finished difference Result 2233 states and 3001 transitions. [2019-11-15 20:12:57,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:12:57,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-15 20:12:57,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:57,655 INFO L225 Difference]: With dead ends: 2233 [2019-11-15 20:12:57,656 INFO L226 Difference]: Without dead ends: 1445 [2019-11-15 20:12:57,658 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-15 20:12:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-15 20:12:57,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-15 20:12:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-15 20:12:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1496 transitions. [2019-11-15 20:12:57,712 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1496 transitions. Word has length 125 [2019-11-15 20:12:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:57,714 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1496 transitions. [2019-11-15 20:12:57,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:12:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1496 transitions. [2019-11-15 20:12:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 20:12:57,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:57,728 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:12:57,729 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:57,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:57,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1189668884, now seen corresponding path program 1 times [2019-11-15 20:12:57,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:57,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799252162] [2019-11-15 20:12:57,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:57,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:57,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 20:12:57,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799252162] [2019-11-15 20:12:57,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:57,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:12:57,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010478561] [2019-11-15 20:12:57,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:12:57,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:57,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:12:57,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:12:57,841 INFO L87 Difference]: Start difference. First operand 1183 states and 1496 transitions. Second operand 3 states. [2019-11-15 20:12:58,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:58,388 INFO L93 Difference]: Finished difference Result 2757 states and 3510 transitions. [2019-11-15 20:12:58,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:12:58,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-15 20:12:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:58,395 INFO L225 Difference]: With dead ends: 2757 [2019-11-15 20:12:58,395 INFO L226 Difference]: Without dead ends: 1576 [2019-11-15 20:12:58,397 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-15 20:12:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-15 20:12:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2019-11-15 20:12:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-15 20:12:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1658 transitions. [2019-11-15 20:12:58,431 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1658 transitions. Word has length 141 [2019-11-15 20:12:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:58,431 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1658 transitions. [2019-11-15 20:12:58,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:12:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1658 transitions. [2019-11-15 20:12:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-15 20:12:58,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:58,435 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:12:58,435 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1199714519, now seen corresponding path program 1 times [2019-11-15 20:12:58,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:58,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29060450] [2019-11-15 20:12:58,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:58,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:58,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:58,498 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 20:12:58,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29060450] [2019-11-15 20:12:58,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:58,498 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:12:58,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010389419] [2019-11-15 20:12:58,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:12:58,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:58,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:12:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:12:58,500 INFO L87 Difference]: Start difference. First operand 1314 states and 1658 transitions. Second operand 3 states. [2019-11-15 20:12:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:58,919 INFO L93 Difference]: Finished difference Result 3281 states and 4119 transitions. [2019-11-15 20:12:58,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:12:58,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-15 20:12:58,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:58,929 INFO L225 Difference]: With dead ends: 3281 [2019-11-15 20:12:58,929 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 20:12:58,931 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-15 20:12:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 20:12:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-11-15 20:12:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-15 20:12:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1962 transitions. [2019-11-15 20:12:58,967 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1962 transitions. Word has length 152 [2019-11-15 20:12:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:58,967 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1962 transitions. [2019-11-15 20:12:58,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:12:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1962 transitions. [2019-11-15 20:12:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-15 20:12:58,971 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:58,972 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:58,972 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash -336243861, now seen corresponding path program 1 times [2019-11-15 20:12:58,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:58,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734504356] [2019-11-15 20:12:58,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:58,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:58,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 20:12:59,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734504356] [2019-11-15 20:12:59,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:59,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:12:59,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151591313] [2019-11-15 20:12:59,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:12:59,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:59,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:12:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:12:59,073 INFO L87 Difference]: Start difference. First operand 1576 states and 1962 transitions. Second operand 4 states. [2019-11-15 20:12:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:12:59,668 INFO L93 Difference]: Finished difference Result 3286 states and 4070 transitions. [2019-11-15 20:12:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:12:59,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-11-15 20:12:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:12:59,677 INFO L225 Difference]: With dead ends: 3286 [2019-11-15 20:12:59,677 INFO L226 Difference]: Without dead ends: 1712 [2019-11-15 20:12:59,679 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-15 20:12:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-11-15 20:12:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1707. [2019-11-15 20:12:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 20:12:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-11-15 20:12:59,718 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 160 [2019-11-15 20:12:59,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:12:59,718 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-11-15 20:12:59,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:12:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-11-15 20:12:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 20:12:59,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:12:59,723 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:12:59,723 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:12:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:12:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 897010083, now seen corresponding path program 1 times [2019-11-15 20:12:59,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:12:59,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794634692] [2019-11-15 20:12:59,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:59,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:12:59,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:12:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:12:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 20:12:59,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794634692] [2019-11-15 20:12:59,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:12:59,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:12:59,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283751428] [2019-11-15 20:12:59,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:12:59,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:12:59,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:12:59,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:12:59,819 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-11-15 20:13:00,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:00,742 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-11-15 20:13:00,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:13:00,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-11-15 20:13:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:00,758 INFO L225 Difference]: With dead ends: 3805 [2019-11-15 20:13:00,758 INFO L226 Difference]: Without dead ends: 2231 [2019-11-15 20:13:00,762 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-15 20:13:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-15 20:13:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-11-15 20:13:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-15 20:13:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2372 transitions. [2019-11-15 20:13:00,803 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2372 transitions. Word has length 164 [2019-11-15 20:13:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:00,804 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2372 transitions. [2019-11-15 20:13:00,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2372 transitions. [2019-11-15 20:13:00,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-15 20:13:00,809 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:00,809 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:00,809 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:00,810 INFO L82 PathProgramCache]: Analyzing trace with hash -114948098, now seen corresponding path program 1 times [2019-11-15 20:13:00,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:00,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812871037] [2019-11-15 20:13:00,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:00,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:00,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-15 20:13:00,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812871037] [2019-11-15 20:13:00,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:00,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:13:00,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579290015] [2019-11-15 20:13:00,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:13:00,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:13:00,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:13:00,859 INFO L87 Difference]: Start difference. First operand 1969 states and 2372 transitions. Second operand 3 states. [2019-11-15 20:13:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:01,335 INFO L93 Difference]: Finished difference Result 4067 states and 4885 transitions. [2019-11-15 20:13:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:13:01,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-15 20:13:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:01,344 INFO L225 Difference]: With dead ends: 4067 [2019-11-15 20:13:01,344 INFO L226 Difference]: Without dead ends: 1969 [2019-11-15 20:13:01,346 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-15 20:13:01,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-15 20:13:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-15 20:13:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 20:13:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1860 transitions. [2019-11-15 20:13:01,385 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1860 transitions. Word has length 167 [2019-11-15 20:13:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:01,386 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1860 transitions. [2019-11-15 20:13:01,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:13:01,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1860 transitions. [2019-11-15 20:13:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-15 20:13:01,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:01,391 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:13:01,391 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:01,392 INFO L82 PathProgramCache]: Analyzing trace with hash 266977410, now seen corresponding path program 1 times [2019-11-15 20:13:01,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:01,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073408776] [2019-11-15 20:13:01,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:01,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:01,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-15 20:13:01,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073408776] [2019-11-15 20:13:01,488 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:01,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:13:01,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386198326] [2019-11-15 20:13:01,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:13:01,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:01,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:13:01,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:13:01,490 INFO L87 Difference]: Start difference. First operand 1707 states and 1860 transitions. Second operand 3 states. [2019-11-15 20:13:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:01,882 INFO L93 Difference]: Finished difference Result 3412 states and 3718 transitions. [2019-11-15 20:13:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:13:01,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-11-15 20:13:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:01,889 INFO L225 Difference]: With dead ends: 3412 [2019-11-15 20:13:01,889 INFO L226 Difference]: Without dead ends: 1707 [2019-11-15 20:13:01,891 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-15 20:13:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-15 20:13:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2019-11-15 20:13:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-15 20:13:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1855 transitions. [2019-11-15 20:13:01,926 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1855 transitions. Word has length 182 [2019-11-15 20:13:01,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:01,927 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1855 transitions. [2019-11-15 20:13:01,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:13:01,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1855 transitions. [2019-11-15 20:13:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-15 20:13:01,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:01,932 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-15 20:13:01,932 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash 912734582, now seen corresponding path program 1 times [2019-11-15 20:13:01,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:01,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641968732] [2019-11-15 20:13:01,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:01,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:01,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 20:13:02,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641968732] [2019-11-15 20:13:02,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543579627] [2019-11-15 20:13:02,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/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-15 20:13:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:02,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:13:02,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:13:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-15 20:13:02,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:13:02,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-15 20:13:02,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418485502] [2019-11-15 20:13:02,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:13:02,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:13:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:13:02,366 INFO L87 Difference]: Start difference. First operand 1707 states and 1855 transitions. Second operand 3 states. [2019-11-15 20:13:02,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:02,781 INFO L93 Difference]: Finished difference Result 2626 states and 2840 transitions. [2019-11-15 20:13:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:13:02,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-11-15 20:13:02,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:02,793 INFO L225 Difference]: With dead ends: 2626 [2019-11-15 20:13:02,793 INFO L226 Difference]: Without dead ends: 2493 [2019-11-15 20:13:02,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 211 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-15 20:13:02,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-15 20:13:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1838. [2019-11-15 20:13:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-15 20:13:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1989 transitions. [2019-11-15 20:13:02,836 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1989 transitions. Word has length 211 [2019-11-15 20:13:02,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:02,836 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1989 transitions. [2019-11-15 20:13:02,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:13:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1989 transitions. [2019-11-15 20:13:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-15 20:13:02,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:02,842 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:13:03,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:13:03,045 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash -872204405, now seen corresponding path program 1 times [2019-11-15 20:13:03,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:03,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902702306] [2019-11-15 20:13:03,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:03,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:03,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:03,936 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 20:13:03,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902702306] [2019-11-15 20:13:03,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:03,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 20:13:03,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014291494] [2019-11-15 20:13:03,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 20:13:03,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:03,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 20:13:03,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-11-15 20:13:03,938 INFO L87 Difference]: Start difference. First operand 1838 states and 1989 transitions. Second operand 13 states. [2019-11-15 20:13:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:05,295 INFO L93 Difference]: Finished difference Result 4256 states and 4613 transitions. [2019-11-15 20:13:05,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:13:05,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 253 [2019-11-15 20:13:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:05,306 INFO L225 Difference]: With dead ends: 4256 [2019-11-15 20:13:05,306 INFO L226 Difference]: Without dead ends: 2420 [2019-11-15 20:13:05,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:13:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-11-15 20:13:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1896. [2019-11-15 20:13:05,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-15 20:13:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2050 transitions. [2019-11-15 20:13:05,344 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2050 transitions. Word has length 253 [2019-11-15 20:13:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:05,345 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2050 transitions. [2019-11-15 20:13:05,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 20:13:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2050 transitions. [2019-11-15 20:13:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-15 20:13:05,351 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:05,352 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:13:05,352 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:05,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:05,355 INFO L82 PathProgramCache]: Analyzing trace with hash 462319416, now seen corresponding path program 1 times [2019-11-15 20:13:05,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:05,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597661764] [2019-11-15 20:13:05,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:05,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:05,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-15 20:13:05,552 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597661764] [2019-11-15 20:13:05,552 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:05,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 20:13:05,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353648775] [2019-11-15 20:13:05,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 20:13:05,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:05,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:13:05,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:05,554 INFO L87 Difference]: Start difference. First operand 1896 states and 2050 transitions. Second operand 6 states. [2019-11-15 20:13:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:06,263 INFO L93 Difference]: Finished difference Result 4221 states and 4562 transitions. [2019-11-15 20:13:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:13:06,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 280 [2019-11-15 20:13:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:06,273 INFO L225 Difference]: With dead ends: 4221 [2019-11-15 20:13:06,274 INFO L226 Difference]: Without dead ends: 2327 [2019-11-15 20:13:06,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:13:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-11-15 20:13:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2027. [2019-11-15 20:13:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2027 states. [2019-11-15 20:13:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2180 transitions. [2019-11-15 20:13:06,318 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2180 transitions. Word has length 280 [2019-11-15 20:13:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:06,318 INFO L462 AbstractCegarLoop]: Abstraction has 2027 states and 2180 transitions. [2019-11-15 20:13:06,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 20:13:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2180 transitions. [2019-11-15 20:13:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-15 20:13:06,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:06,325 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:06,326 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:06,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:06,326 INFO L82 PathProgramCache]: Analyzing trace with hash 693576989, now seen corresponding path program 1 times [2019-11-15 20:13:06,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:06,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364223866] [2019-11-15 20:13:06,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:06,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:06,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 20:13:06,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364223866] [2019-11-15 20:13:06,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:06,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:13:06,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109055022] [2019-11-15 20:13:06,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:13:06,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:13:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:13:06,572 INFO L87 Difference]: Start difference. First operand 2027 states and 2180 transitions. Second operand 5 states. [2019-11-15 20:13:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:07,524 INFO L93 Difference]: Finished difference Result 4969 states and 5350 transitions. [2019-11-15 20:13:07,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:13:07,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 291 [2019-11-15 20:13:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:07,533 INFO L225 Difference]: With dead ends: 4969 [2019-11-15 20:13:07,534 INFO L226 Difference]: Without dead ends: 1896 [2019-11-15 20:13:07,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-15 20:13:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-11-15 20:13:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1896. [2019-11-15 20:13:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-11-15 20:13:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 1999 transitions. [2019-11-15 20:13:07,578 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 1999 transitions. Word has length 291 [2019-11-15 20:13:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:07,579 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 1999 transitions. [2019-11-15 20:13:07,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:13:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 1999 transitions. [2019-11-15 20:13:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-11-15 20:13:07,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:13:07,586 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:13:07,586 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:13:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:13:07,586 INFO L82 PathProgramCache]: Analyzing trace with hash -591222129, now seen corresponding path program 1 times [2019-11-15 20:13:07,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:13:07,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691176238] [2019-11-15 20:13:07,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:13:07,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:13:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:13:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-15 20:13:07,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691176238] [2019-11-15 20:13:07,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:13:07,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:13:07,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176683261] [2019-11-15 20:13:07,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:13:07,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:13:07,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:13:07,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:13:07,803 INFO L87 Difference]: Start difference. First operand 1896 states and 1999 transitions. Second operand 4 states. [2019-11-15 20:13:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:13:08,380 INFO L93 Difference]: Finished difference Result 3657 states and 3861 transitions. [2019-11-15 20:13:08,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:13:08,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 302 [2019-11-15 20:13:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:13:08,382 INFO L225 Difference]: With dead ends: 3657 [2019-11-15 20:13:08,382 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:13:08,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:13:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:13:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:13:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:13:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:13:08,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 302 [2019-11-15 20:13:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:13:08,386 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:13:08,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:13:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:13:08,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:13:08,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:13:08,531 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 107 [2019-11-15 20:13:08,651 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 106 [2019-11-15 20:13:09,138 WARN L191 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 54 [2019-11-15 20:13:09,618 WARN L191 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 54 [2019-11-15 20:13:09,620 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-15 20:13:09,620 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-15 20:13:09,620 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,620 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,620 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-15 20:13:09,621 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-15 20:13:09,622 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,623 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-15 20:13:09,624 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-15 20:13:09,624 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-15 20:13:09,624 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-15 20:13:09,624 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-15 20:13:09,624 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-15 20:13:09,624 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-15 20:13:09,624 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-15 20:13:09,624 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-15 20:13:09,625 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse0 (= 1 ~a7~0)) (.cse1 (not .cse8)) (.cse3 (= ~a20~0 1)) (.cse2 (= ~a17~0 1)) (.cse7 (not (= ~a7~0 1))) (.cse5 (= ~a12~0 8)) (.cse4 (= ~a21~0 1)) (.cse6 (= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse1 .cse4 (= 14 ~a8~0)) (and .cse0 .cse1 .cse5 .cse4 .cse6) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) (= ~a16~0 4) .cse5 (<= ~a17~0 0) .cse4 .cse6 (<= ~a20~0 0)) (and (and .cse7 .cse1 .cse4) (not .cse6)) (and .cse3 .cse4) (and (<= 15 ~a8~0) .cse4 (= 5 ~a16~0)) (and .cse7 .cse2 .cse5 .cse4 .cse6) (and .cse7 .cse5 .cse4 .cse6 .cse8)))) [2019-11-15 20:13:09,625 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,625 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,625 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,625 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,629 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,629 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-15 20:13:09,630 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-15 20:13:09,630 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-15 20:13:09,630 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-15 20:13:09,630 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-15 20:13:09,630 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-15 20:13:09,630 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-15 20:13:09,630 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-15 20:13:09,630 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-15 20:13:09,631 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 530) no Hoare annotation was computed. [2019-11-15 20:13:09,631 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-15 20:13:09,631 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-15 20:13:09,631 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-15 20:13:09,631 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-15 20:13:09,631 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-15 20:13:09,631 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,631 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,632 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,632 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,632 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,632 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-15 20:13:09,632 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-15 20:13:09,632 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-15 20:13:09,632 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-15 20:13:09,632 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-15 20:13:09,633 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-15 20:13:09,633 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-15 20:13:09,633 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-15 20:13:09,633 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-15 20:13:09,633 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,633 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,633 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,633 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,634 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-15 20:13:09,634 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,634 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-15 20:13:09,634 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-15 20:13:09,634 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-15 20:13:09,634 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-15 20:13:09,634 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-15 20:13:09,634 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-15 20:13:09,635 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-15 20:13:09,635 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:13:09,635 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-15 20:13:09,635 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-15 20:13:09,635 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-15 20:13:09,635 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-15 20:13:09,636 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-15 20:13:09,636 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-15 20:13:09,636 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,637 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse0 (= 1 ~a7~0)) (.cse1 (not .cse8)) (.cse3 (= ~a20~0 1)) (.cse2 (= ~a17~0 1)) (.cse7 (not (= ~a7~0 1))) (.cse5 (= ~a12~0 8)) (.cse4 (= ~a21~0 1)) (.cse6 (= 15 ~a8~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse1 .cse4 (= 14 ~a8~0)) (and .cse0 .cse1 .cse5 .cse4 .cse6) (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) (= ~a16~0 4) .cse5 (<= ~a17~0 0) .cse4 .cse6 (<= ~a20~0 0)) (and (and .cse7 .cse1 .cse4) (not .cse6)) (and .cse3 .cse4) (and (<= 15 ~a8~0) .cse4 (= 5 ~a16~0)) (and .cse7 .cse2 .cse5 .cse4 .cse6) (and .cse7 .cse5 .cse4 .cse6 .cse8)))) [2019-11-15 20:13:09,637 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,637 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,637 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,637 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,637 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-15 20:13:09,638 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-15 20:13:09,638 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-15 20:13:09,638 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-15 20:13:09,638 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-15 20:13:09,638 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-15 20:13:09,638 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-15 20:13:09,638 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-15 20:13:09,638 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,639 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,639 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,639 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,639 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,639 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-15 20:13:09,639 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:13:09,639 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-15 20:13:09,639 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-15 20:13:09,640 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-15 20:13:09,640 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-15 20:13:09,640 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-15 20:13:09,640 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-15 20:13:09,640 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-15 20:13:09,640 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-15 20:13:09,640 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-15 20:13:09,640 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-15 20:13:09,641 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-15 20:13:09,641 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,641 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,641 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,641 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,641 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-15 20:13:09,641 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,641 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-15 20:13:09,642 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-15 20:13:09,643 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-15 20:13:09,643 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-15 20:13:09,643 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-15 20:13:09,643 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-15 20:13:09,643 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,643 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,643 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,643 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,644 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,644 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-15 20:13:09,644 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,644 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-15 20:13:09,644 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-15 20:13:09,644 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-15 20:13:09,644 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-15 20:13:09,644 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-15 20:13:09,645 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-15 20:13:09,645 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-15 20:13:09,645 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-15 20:13:09,645 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-15 20:13:09,645 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-15 20:13:09,645 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-15 20:13:09,645 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:13:09,645 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-15 20:13:09,646 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-15 20:13:09,647 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-15 20:13:09,647 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-15 20:13:09,647 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-15 20:13:09,647 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-15 20:13:09,647 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-15 20:13:09,647 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-15 20:13:09,647 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-15 20:13:09,647 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-15 20:13:09,648 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-15 20:13:09,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:13:09 BoogieIcfgContainer [2019-11-15 20:13:09,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:13:09,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:13:09,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:13:09,683 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:13:09,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:12:53" (3/4) ... [2019-11-15 20:13:09,686 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 20:13:09,712 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 20:13:09,713 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 20:13:09,897 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f3880260-1a21-4017-a007-f0e70709f82a/bin/uautomizer/witness.graphml [2019-11-15 20:13:09,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:13:09,899 INFO L168 Benchmark]: Toolchain (without parser) took 18080.78 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 587.2 MB). Free memory was 939.4 MB in the beginning and 936.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 590.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:09,899 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:13:09,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 586.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:09,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.38 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: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:09,900 INFO L168 Benchmark]: Boogie Preprocessor took 95.91 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: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:09,901 INFO L168 Benchmark]: RCFGBuilder took 1281.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 966.2 MB in the end (delta: 115.6 MB). Peak memory consumption was 115.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:09,901 INFO L168 Benchmark]: TraceAbstraction took 15804.99 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 468.2 MB). Free memory was 966.2 MB in the beginning and 956.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 477.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:09,901 INFO L168 Benchmark]: Witness Printer took 215.25 ms. Allocated memory is still 1.6 GB. Free memory was 956.7 MB in the beginning and 936.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:13:09,903 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 586.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.38 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: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.91 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: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1281.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 966.2 MB in the end (delta: 115.6 MB). Peak memory consumption was 115.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15804.99 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 468.2 MB). Free memory was 966.2 MB in the beginning and 956.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 477.7 MB. Max. memory is 11.5 GB. * Witness Printer took 215.25 ms. Allocated memory is still 1.6 GB. Free memory was 956.7 MB in the beginning and 936.4 MB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 530]: 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 && !(a16 == 6)) && a17 == 1) || (1 == a7 && a20 == 1)) || ((!(a16 == 6) && a21 == 1) && 14 == a8)) || ((((1 == a7 && !(a16 == 6)) && a12 == 8) && a21 == 1) && 15 == a8)) || (((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0)) || (((!(a7 == 1) && !(a16 == 6)) && a21 == 1) && !(15 == a8))) || (a20 == 1 && a21 == 1)) || ((15 <= a8 && a21 == 1) && 5 == a16)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((1 == a7 && !(a16 == 6)) && a17 == 1) || (1 == a7 && a20 == 1)) || ((!(a16 == 6) && a21 == 1) && 14 == a8)) || ((((1 == a7 && !(a16 == 6)) && a12 == 8) && a21 == 1) && 15 == a8)) || (((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0)) || (((!(a7 == 1) && !(a16 == 6)) && a21 == 1) && !(15 == a8))) || (a20 == 1 && a21 == 1)) || ((15 <= a8 && a21 == 1) && 5 == a16)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8)) || ((((!(a7 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 15.6s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 833 SDtfs, 2921 SDslu, 164 SDs, 0 SdLazy, 7765 SolverSat, 980 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 233 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2027occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 3056 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 307 HoareAnnotationTreeSize, 3 FomulaSimplifications, 52856 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2662 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2881 NumberOfCodeBlocks, 2881 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2866 ConstructedInterpolants, 0 QuantifiedInterpolants, 2089833 SizeOfPredicates, 1 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 2023/2050 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...