./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.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_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/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 785a7f7444547118219ac2dc565afc7f15fbca51 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:40:31,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:40:31,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:40:31,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:40:31,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:40:31,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:40:31,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:40:31,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:40:31,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:40:31,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:40:31,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:40:31,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:40:31,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:40:31,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:40:31,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:40:31,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:40:31,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:40:31,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:40:31,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:40:31,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:40:31,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:40:31,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:40:31,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:40:31,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:40:31,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:40:31,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:40:31,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:40:31,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:40:31,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:40:31,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:40:31,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:40:31,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:40:31,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:40:31,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:40:31,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:40:31,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:40:31,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:40:31,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:40:31,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:40:31,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:40:31,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:40:31,772 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:40:31,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:40:31,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:40:31,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:40:31,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:40:31,789 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:40:31,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:40:31,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:40:31,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:40:31,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:40:31,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:40:31,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:40:31,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:40:31,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:40:31,792 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:40:31,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:40:31,792 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:40:31,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:40:31,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:40:31,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:40:31,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:40:31,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:40:31,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:31,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:40:31,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:40:31,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:40:31,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:40:31,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:40:31,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:40:31,798 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_6adb4d5c-5a56-410e-9d12-3e6871bd909c/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 -> 785a7f7444547118219ac2dc565afc7f15fbca51 [2019-11-16 00:40:31,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:40:31,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:40:31,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:40:31,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:40:31,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:40:31,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2019-11-16 00:40:31,907 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/data/7bd7e780f/e7f7ba972f7e4267acb348e56fcb6925/FLAGc75d85871 [2019-11-16 00:40:32,407 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:40:32,408 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2019-11-16 00:40:32,420 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/data/7bd7e780f/e7f7ba972f7e4267acb348e56fcb6925/FLAGc75d85871 [2019-11-16 00:40:32,877 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/data/7bd7e780f/e7f7ba972f7e4267acb348e56fcb6925 [2019-11-16 00:40:32,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:40:32,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:40:32,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:32,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:40:32,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:40:32,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5365288b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:32, skipping insertion in model container [2019-11-16 00:40:32,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:32" (1/1) ... [2019-11-16 00:40:32,895 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:40:32,952 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:40:33,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:33,354 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:40:33,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:33,486 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:40:33,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33 WrapperNode [2019-11-16 00:40:33,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:33,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:33,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:40:33,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:40:33,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:33,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:40:33,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:40:33,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:40:33,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... [2019-11-16 00:40:33,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:40:33,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:40:33,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:40:33,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:40:33,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:33,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:40:33,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:40:35,095 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:40:35,095 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:40:35,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:35 BoogieIcfgContainer [2019-11-16 00:40:35,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:40:35,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:40:35,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:40:35,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:40:35,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:40:32" (1/3) ... [2019-11-16 00:40:35,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea3a4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:35, skipping insertion in model container [2019-11-16 00:40:35,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:33" (2/3) ... [2019-11-16 00:40:35,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea3a4d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:35, skipping insertion in model container [2019-11-16 00:40:35,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:35" (3/3) ... [2019-11-16 00:40:35,107 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label00.c [2019-11-16 00:40:35,116 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:40:35,125 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:40:35,135 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:40:35,163 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:40:35,165 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:40:35,165 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:40:35,165 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:40:35,166 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:40:35,166 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:40:35,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:40:35,168 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:40:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-16 00:40:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-16 00:40:35,219 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:35,220 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] [2019-11-16 00:40:35,222 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:35,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:35,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1766677921, now seen corresponding path program 1 times [2019-11-16 00:40:35,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:35,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123255923] [2019-11-16 00:40:35,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:35,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:35,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:35,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123255923] [2019-11-16 00:40:35,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:35,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:35,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095795817] [2019-11-16 00:40:35,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:35,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:35,787 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-16 00:40:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:37,188 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-16 00:40:37,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:37,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-16 00:40:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:37,215 INFO L225 Difference]: With dead ends: 662 [2019-11-16 00:40:37,216 INFO L226 Difference]: Without dead ends: 397 [2019-11-16 00:40:37,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-16 00:40:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-16 00:40:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-16 00:40:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-16 00:40:37,316 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 108 [2019-11-16 00:40:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:37,319 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-16 00:40:37,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-16 00:40:37,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-16 00:40:37,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:37,328 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] [2019-11-16 00:40:37,329 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1731030898, now seen corresponding path program 1 times [2019-11-16 00:40:37,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:37,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407986427] [2019-11-16 00:40:37,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:37,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:37,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:37,412 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-16 00:40:37,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407986427] [2019-11-16 00:40:37,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:37,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:37,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258672336] [2019-11-16 00:40:37,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:37,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:37,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:37,416 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-16 00:40:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:38,189 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-16 00:40:38,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:38,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-16 00:40:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:38,195 INFO L225 Difference]: With dead ends: 1054 [2019-11-16 00:40:38,196 INFO L226 Difference]: Without dead ends: 790 [2019-11-16 00:40:38,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-16 00:40:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-16 00:40:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-16 00:40:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-16 00:40:38,238 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 114 [2019-11-16 00:40:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:38,239 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-16 00:40:38,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-16 00:40:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-16 00:40:38,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:38,243 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] [2019-11-16 00:40:38,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1128519054, now seen corresponding path program 1 times [2019-11-16 00:40:38,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:38,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568379523] [2019-11-16 00:40:38,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:38,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:38,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:38,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568379523] [2019-11-16 00:40:38,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:38,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:40:38,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996207708] [2019-11-16 00:40:38,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:38,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:38,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:38,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:38,415 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2019-11-16 00:40:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:39,192 INFO L93 Difference]: Finished difference Result 1578 states and 2134 transitions. [2019-11-16 00:40:39,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:40:39,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-16 00:40:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:39,201 INFO L225 Difference]: With dead ends: 1578 [2019-11-16 00:40:39,202 INFO L226 Difference]: Without dead ends: 790 [2019-11-16 00:40:39,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:39,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-16 00:40:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-16 00:40:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-16 00:40:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 994 transitions. [2019-11-16 00:40:39,250 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 994 transitions. Word has length 115 [2019-11-16 00:40:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:39,252 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 994 transitions. [2019-11-16 00:40:39,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 994 transitions. [2019-11-16 00:40:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-16 00:40:39,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:39,256 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:40:39,257 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash -544120587, now seen corresponding path program 1 times [2019-11-16 00:40:39,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:39,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928036792] [2019-11-16 00:40:39,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:39,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:39,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:40:39,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928036792] [2019-11-16 00:40:39,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:39,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:40:39,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660649783] [2019-11-16 00:40:39,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:39,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:39,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:39,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:39,337 INFO L87 Difference]: Start difference. First operand 790 states and 994 transitions. Second operand 3 states. [2019-11-16 00:40:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:39,875 INFO L93 Difference]: Finished difference Result 2233 states and 2809 transitions. [2019-11-16 00:40:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:39,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-16 00:40:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:39,883 INFO L225 Difference]: With dead ends: 2233 [2019-11-16 00:40:39,884 INFO L226 Difference]: Without dead ends: 1445 [2019-11-16 00:40:39,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-16 00:40:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-11-16 00:40:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-16 00:40:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1429 transitions. [2019-11-16 00:40:39,919 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1429 transitions. Word has length 126 [2019-11-16 00:40:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:39,920 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1429 transitions. [2019-11-16 00:40:39,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1429 transitions. [2019-11-16 00:40:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-16 00:40:39,923 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:39,923 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-11-16 00:40:39,923 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:39,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1267766409, now seen corresponding path program 1 times [2019-11-16 00:40:39,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:39,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438864985] [2019-11-16 00:40:39,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:39,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:39,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:40:40,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438864985] [2019-11-16 00:40:40,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:40,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:40,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006186145] [2019-11-16 00:40:40,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:40:40,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:40,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:40:40,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:40:40,071 INFO L87 Difference]: Start difference. First operand 1183 states and 1429 transitions. Second operand 4 states. [2019-11-16 00:40:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:40,722 INFO L93 Difference]: Finished difference Result 2500 states and 3010 transitions. [2019-11-16 00:40:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:40:40,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-16 00:40:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:40,731 INFO L225 Difference]: With dead ends: 2500 [2019-11-16 00:40:40,731 INFO L226 Difference]: Without dead ends: 1319 [2019-11-16 00:40:40,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:40:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-16 00:40:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2019-11-16 00:40:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-16 00:40:40,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1566 transitions. [2019-11-16 00:40:40,767 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1566 transitions. Word has length 134 [2019-11-16 00:40:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:40,769 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1566 transitions. [2019-11-16 00:40:40,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:40:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1566 transitions. [2019-11-16 00:40:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-16 00:40:40,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:40,772 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:40,773 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:40,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1620959425, now seen corresponding path program 1 times [2019-11-16 00:40:40,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:40,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107293559] [2019-11-16 00:40:40,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:40,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:40,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:40:40,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107293559] [2019-11-16 00:40:40,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:40,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:40:40,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685018736] [2019-11-16 00:40:40,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:40:40,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:40,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:40:40,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:40:40,863 INFO L87 Difference]: Start difference. First operand 1314 states and 1566 transitions. Second operand 5 states. [2019-11-16 00:40:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:41,892 INFO L93 Difference]: Finished difference Result 2626 states and 3160 transitions. [2019-11-16 00:40:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:40:41,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-11-16 00:40:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:41,901 INFO L225 Difference]: With dead ends: 2626 [2019-11-16 00:40:41,901 INFO L226 Difference]: Without dead ends: 1445 [2019-11-16 00:40:41,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:40:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-16 00:40:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-16 00:40:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-16 00:40:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1691 transitions. [2019-11-16 00:40:41,950 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1691 transitions. Word has length 138 [2019-11-16 00:40:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:41,951 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1691 transitions. [2019-11-16 00:40:41,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:40:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1691 transitions. [2019-11-16 00:40:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-16 00:40:41,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:41,955 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:41,956 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash -633054500, now seen corresponding path program 1 times [2019-11-16 00:40:41,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:41,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218551553] [2019-11-16 00:40:41,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:41,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:41,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-16 00:40:42,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218551553] [2019-11-16 00:40:42,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:42,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:40:42,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384012532] [2019-11-16 00:40:42,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:42,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:42,034 INFO L87 Difference]: Start difference. First operand 1445 states and 1691 transitions. Second operand 3 states. [2019-11-16 00:40:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:42,555 INFO L93 Difference]: Finished difference Result 3281 states and 3857 transitions. [2019-11-16 00:40:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:42,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-16 00:40:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:42,564 INFO L225 Difference]: With dead ends: 3281 [2019-11-16 00:40:42,564 INFO L226 Difference]: Without dead ends: 1707 [2019-11-16 00:40:42,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-16 00:40:42,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-16 00:40:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-16 00:40:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1559 transitions. [2019-11-16 00:40:42,600 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1559 transitions. Word has length 141 [2019-11-16 00:40:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:42,601 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1559 transitions. [2019-11-16 00:40:42,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1559 transitions. [2019-11-16 00:40:42,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-16 00:40:42,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:42,605 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:42,605 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:42,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:42,605 INFO L82 PathProgramCache]: Analyzing trace with hash 728477792, now seen corresponding path program 1 times [2019-11-16 00:40:42,606 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:42,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803171124] [2019-11-16 00:40:42,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:42,606 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:42,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:40:42,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803171124] [2019-11-16 00:40:42,689 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:42,689 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:40:42,689 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819384938] [2019-11-16 00:40:42,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:42,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:42,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:42,691 INFO L87 Difference]: Start difference. First operand 1445 states and 1559 transitions. Second operand 3 states. [2019-11-16 00:40:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:43,131 INFO L93 Difference]: Finished difference Result 3543 states and 3847 transitions. [2019-11-16 00:40:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:43,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-16 00:40:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:43,142 INFO L225 Difference]: With dead ends: 3543 [2019-11-16 00:40:43,143 INFO L226 Difference]: Without dead ends: 2231 [2019-11-16 00:40:43,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:40:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-16 00:40:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1838. [2019-11-16 00:40:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-16 00:40:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1972 transitions. [2019-11-16 00:40:43,199 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1972 transitions. Word has length 156 [2019-11-16 00:40:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:43,199 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1972 transitions. [2019-11-16 00:40:43,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1972 transitions. [2019-11-16 00:40:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-16 00:40:43,204 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:43,204 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:40:43,204 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash -519802284, now seen corresponding path program 1 times [2019-11-16 00:40:43,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:40:43,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763774599] [2019-11-16 00:40:43,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:43,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:40:43,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:40:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:40:43,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763774599] [2019-11-16 00:40:43,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583264154] [2019-11-16 00:40:43,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:43,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:40:43,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-16 00:40:43,559 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:40:43,559 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:40:43,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337251094] [2019-11-16 00:40:43,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:40:43,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:40:43,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:40:43,561 INFO L87 Difference]: Start difference. First operand 1838 states and 1972 transitions. Second operand 3 states. [2019-11-16 00:40:43,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:43,967 INFO L93 Difference]: Finished difference Result 1969 states and 2119 transitions. [2019-11-16 00:40:43,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:40:43,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-16 00:40:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:43,968 INFO L225 Difference]: With dead ends: 1969 [2019-11-16 00:40:43,968 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:40:43,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:40:43,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:40:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:40:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:40:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:40:43,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 185 [2019-11-16 00:40:43,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:43,971 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:40:43,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:40:43,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:40:43,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:40:44,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:44,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:40:44,414 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-16 00:40:44,414 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-16 00:40:44,414 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 500) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-16 00:40:44,415 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,416 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-16 00:40:44,417 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,418 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-16 00:40:44,419 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-16 00:40:44,419 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-16 00:40:44,419 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-16 00:40:44,419 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-16 00:40:44,419 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-16 00:40:44,419 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-16 00:40:44,419 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-16 00:40:44,419 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (not (= ~a16~0 5)))) (or (= ~a16~0 4) (and .cse0 .cse1) (and .cse0 (<= ~a21~0 0) .cse2) (and .cse2 (= ~a21~0 1) .cse1) (not (= ~a8~0 13)))) [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-16 00:40:44,420 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-16 00:40:44,425 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-16 00:40:44,425 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-16 00:40:44,425 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-16 00:40:44,426 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-16 00:40:44,426 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-16 00:40:44,426 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-16 00:40:44,426 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-16 00:40:44,426 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-16 00:40:44,426 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-16 00:40:44,427 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-16 00:40:44,427 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,427 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,427 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,427 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,428 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,428 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-16 00:40:44,428 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-16 00:40:44,428 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-16 00:40:44,428 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-16 00:40:44,428 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-16 00:40:44,428 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-16 00:40:44,429 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-16 00:40:44,429 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-16 00:40:44,429 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-16 00:40:44,429 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,429 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,429 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,429 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,429 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-16 00:40:44,430 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,430 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-16 00:40:44,430 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-16 00:40:44,430 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-16 00:40:44,430 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-16 00:40:44,430 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-16 00:40:44,430 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-16 00:40:44,431 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-16 00:40:44,431 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:40:44,431 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-16 00:40:44,431 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-16 00:40:44,431 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-16 00:40:44,431 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-16 00:40:44,432 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-16 00:40:44,432 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-16 00:40:44,432 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,433 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0)) (.cse2 (= ~a17~0 1)) (.cse1 (not (= ~a16~0 5)))) (or (= ~a16~0 4) (and .cse0 .cse1) (and .cse0 (<= ~a21~0 0) .cse2) (and .cse2 (= ~a21~0 1) .cse1) (not (= ~a8~0 13)))) [2019-11-16 00:40:44,433 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,433 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,433 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,433 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,433 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-16 00:40:44,434 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-16 00:40:44,434 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-16 00:40:44,434 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-16 00:40:44,434 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-16 00:40:44,434 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-16 00:40:44,434 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-16 00:40:44,434 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-16 00:40:44,435 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,435 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,435 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,435 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,435 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,435 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-16 00:40:44,435 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:40:44,436 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-16 00:40:44,436 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-16 00:40:44,436 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-16 00:40:44,436 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-16 00:40:44,436 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-16 00:40:44,436 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-16 00:40:44,436 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-16 00:40:44,437 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-16 00:40:44,437 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-16 00:40:44,437 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-16 00:40:44,437 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-16 00:40:44,437 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,437 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,437 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,438 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,438 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-16 00:40:44,438 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,438 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,438 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-16 00:40:44,438 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-16 00:40:44,438 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:40:44,439 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-16 00:40:44,439 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-16 00:40:44,439 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-16 00:40:44,439 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-16 00:40:44,439 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-16 00:40:44,439 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-16 00:40:44,439 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-16 00:40:44,440 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-16 00:40:44,440 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-16 00:40:44,440 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-16 00:40:44,440 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,440 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,440 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,440 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,441 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,441 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-16 00:40:44,441 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,441 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-16 00:40:44,441 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-16 00:40:44,441 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-16 00:40:44,441 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-16 00:40:44,442 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-16 00:40:44,442 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-16 00:40:44,442 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-16 00:40:44,442 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-16 00:40:44,442 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-16 00:40:44,442 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-16 00:40:44,442 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-16 00:40:44,443 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:40:44,443 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-16 00:40:44,443 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-16 00:40:44,443 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-16 00:40:44,443 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,443 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,443 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,444 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,444 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,444 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:40:44,444 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-16 00:40:44,444 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-16 00:40:44,444 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-16 00:40:44,444 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-16 00:40:44,444 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-16 00:40:44,445 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-16 00:40:44,445 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-16 00:40:44,445 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-16 00:40:44,445 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-16 00:40:44,445 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-16 00:40:44,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:40:44 BoogieIcfgContainer [2019-11-16 00:40:44,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:40:44,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:40:44,480 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:40:44,480 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:40:44,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:35" (3/4) ... [2019-11-16 00:40:44,483 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:40:44,515 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:40:44,516 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:40:44,736 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6adb4d5c-5a56-410e-9d12-3e6871bd909c/bin/uautomizer/witness.graphml [2019-11-16 00:40:44,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:40:44,739 INFO L168 Benchmark]: Toolchain (without parser) took 11857.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 411.6 MB). Free memory was 940.7 MB in the beginning and 1.4 GB in the end (delta: -442.7 MB). Peak memory consumption was 438.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:44,739 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:40:44,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 606.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:44,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:40:44,740 INFO L168 Benchmark]: Boogie Preprocessor took 77.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:44,741 INFO L168 Benchmark]: RCFGBuilder took 1434.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 967.9 MB in the end (delta: 117.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:44,741 INFO L168 Benchmark]: TraceAbstraction took 9381.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 967.9 MB in the beginning and 815.4 MB in the end (delta: 152.5 MB). Peak memory consumption was 334.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:44,741 INFO L168 Benchmark]: Witness Printer took 257.45 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 105.4 MB). Free memory was 815.4 MB in the beginning and 1.4 GB in the end (delta: -568.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:44,744 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.45 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 606.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -152.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1434.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 967.9 MB in the end (delta: 117.9 MB). Peak memory consumption was 117.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9381.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.9 MB). Free memory was 967.9 MB in the beginning and 815.4 MB in the end (delta: 152.5 MB). Peak memory consumption was 334.5 MB. Max. memory is 11.5 GB. * Witness Printer took 257.45 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 105.4 MB). Free memory was 815.4 MB in the beginning and 1.4 GB in the end (delta: -568.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 500]: 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: (((a16 == 4 || (1 == a7 && !(a16 == 5))) || ((1 == a7 && a21 <= 0) && a17 == 1)) || ((a17 == 1 && a21 == 1) && !(a16 == 5))) || !(a8 == 13) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((a16 == 4 || (1 == a7 && !(a16 == 5))) || ((1 == a7 && a21 <= 0) && a17 == 1)) || ((a17 == 1 && a21 == 1) && !(a16 == 5))) || !(a8 == 13) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.2s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 830 SDtfs, 1953 SDslu, 93 SDs, 0 SdLazy, 4427 SolverSat, 786 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 75 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1208 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 116 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1402 NumberOfCodeBlocks, 1402 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1392 ConstructedInterpolants, 0 QuantifiedInterpolants, 487642 SizeOfPredicates, 1 NumberOfNonLiveVariables, 329 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 450/477 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...